Exemining and improving the security of elliptic curve cryptography – Mgr. Vladimír Sedláček
Mgr. Vladimír Sedláček
Advanced ('rigorózní') thesis
Exemining and improving the security of elliptic curve cryptography
Exemining and improving the security of elliptic curve cryptography
Abstract:
Clem navrhovaného výzkumu je analyzovat, zda kryptografie eliptických křivek skutečně poskytuje očekávanou úroveň bezpečnosti. To zahrnuje podrobné zkoumání standardních křivek novým způsobem, snahu propojit veřejné klíče se zdrojem, který je vyprodukoval, nalezení nových teoretických slabin nebo zranitelných implementací a konečně detailnější průzkum postkvantových schémat založených na isogeniích …moreAbstract:
The focus of the proposed research is to analyze whether elliptic curve cryptography really provides the expected level of security. This includes closely inspecting standardized curves in a new way, trying to link public keys to the source that produced them, finding new theoretical weaknesses or vulnerable implementations and finally examining the post-quantum schemes based on isogenies of supersingular …more
Language used: English
Date on which the thesis was submitted / produced: 27. 11. 2019
Identifier:
https://is.muni.cz/th/vzvjz/
Thesis defence
- Date of defence: 14. 1. 2020
- Reader: Dr. Graham Steel, prof. Ing. Pavol Zajac, Ph.D.
Citation record
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsAdvanced ('rigorózní řízení') programme / field:
Computer systems, communication and security / Computer systems, communication and security
Theses on a related topic
-
Simulation of real-world side-channel attacks on elliptic-curve cryptography
Andrej Bátora -
PYECSCA: Reverse-engineering black-box Elliptic Curve Cryptography implementations via side-channels
Ján Jančár -
Designing Optimized Architecture for Solving Elliptic Curve Discrete Log Problem Using Pollard's rho method
Harshit Kumar Singh -
Security considerations for elliptic curve domain parameters selection
Ján Jančár -
Cycles of pairing-friendly elliptic curves and their applications in cryptography
Tomáš Novotný