|
|
Elliptic curve based cryptosystems
Křivka, Petr ; Hajný, Jan (referee) ; Stančík, Peter (advisor)
In this bachelor thesis is examined problems elliptic curve cryptosystems. It is described mathematical underground, which use these systems. In more details is analyzed arithmetic finite fields. An important part of this work is the analysis of elliptical curves in cryptography. Among analyzed algorithms include e.g. ECDH or ECDSA. In conclusion is designed software solution, which helps in the study cryptosystems based elliptic curves. It allows basic operations over prime field.
|
|
| |
|
|
Two types of septic trinomials and their use in hyperelliptic cryptography
Felcmanová, Adéla ; Tomáš, Jiří (referee) ; Kureš, Miroslav (advisor)
This thesis deals with two types of septic trinomials and genus three hyperelliptic curves constructed from them. It includes an introduction to the theory of hyperelliptic curves and divisors, as well as terms and algorithms necessary for their implementation in hyperelliptic cryptosystems. The principle of the hyperelliptic curve cryptography is presented along with two examples of cryptosystems. It also contains several exercises, some of which were programmed in Python language.
|
|
|
Two types of septic trinomials and their use in hyperelliptic cryptography
Felcmanová, Adéla ; Tomáš, Jiří (referee) ; Kureš, Miroslav (advisor)
This thesis deals with two types of septic trinomials and genus three hyperelliptic curves constructed from them. It includes an introduction to the theory of hyperelliptic curves and divisors, as well as terms and algorithms necessary for their implementation in hyperelliptic cryptosystems. The principle of the hyperelliptic curve cryptography is presented along with two examples of cryptosystems. It also contains several exercises, some of which were programmed in Python language.
|
|
|
Combinatorial group theory and cryptography
Ferov, Michal ; Příhoda, Pavel (advisor) ; Růžička, Pavel (referee)
In the presented work we focus on applications of decision problems from combinatorial group theory. Namely we analyse the Shpilrain-Zapata pro- tocol. We give formal proof that small cancellation groups are good platform for the protocol because the word problem is solvable in linear time and they are generic. We also analyse the complexity of the brute force attack on the protocol and show that in a theoretical way the protocol is immune to attack by adversary with arbitrary computing power.
|
|
|
A study on ``A New Public-Key Cryptosystem via Mersenne Numbers''
Richter, Filip ; Göloglu, Faruk (advisor) ; El Bashir, Robert (referee)
In 2016 NIST announced a start of a process of development and standardiza- tion of a post-quantum public-key encryption scheme. Mersenne-756839 was one of the proposals. This proposal is described in this thesis, as well as the known attacks against it. The description and the theoretical background behind these attacks are presented in a rigorous way and are accessible to the reader without any previous knowledge about the post-quantum cryptography. New additional ideas for the implementation of the attacks are also presented. Finally, these attacks are implemented and attached to the thesis. 1
|
|
|
Comparing Groups of Public-Key Ciphers
Lukáš, Martin ; Ivánek, Jiří (advisor) ; Palovský, Radomír (referee)
In this thesis, I introduce several groups of public-key algorithms, the groups being factori-zation problem, discrete logarithm problem, and other problems. I choose one representa-tive algorithm from each group and describe it in-depth, also mentioning certain aspects used in real world implementations and most important attacks. other problems. The objec-tives of this thesis are to compare these groups as well as algorithms in them according to their operational speed, key lengths and resistance against quantum cryptanalysis.
|
|
|
Combinatorial group theory and cryptography
Ferov, Michal ; Příhoda, Pavel (advisor) ; Růžička, Pavel (referee)
In the presented work we focus on applications of decision problems from combinatorial group theory. Namely we analyse the Shpilrain-Zapata pro- tocol. We give formal proof that small cancellation groups are good platform for the protocol because the word problem is solvable in linear time and they are generic. We also analyse the complexity of the brute force attack on the protocol and show that in a theoretical way the protocol is immune to attack by adversary with arbitrary computing power.
|
|
| |
|
|
Elliptic curve based cryptosystems
Křivka, Petr ; Hajný, Jan (referee) ; Stančík, Peter (advisor)
In this bachelor thesis is examined problems elliptic curve cryptosystems. It is described mathematical underground, which use these systems. In more details is analyzed arithmetic finite fields. An important part of this work is the analysis of elliptical curves in cryptography. Among analyzed algorithms include e.g. ECDH or ECDSA. In conclusion is designed software solution, which helps in the study cryptosystems based elliptic curves. It allows basic operations over prime field.
|
guest ::
