|
|
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.
|
|
|
MQ problem
Středa, Adolf ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
The aim of this thesis is to describe a general MQ Problem with a focus on its variant called HFE, outline several attacks on a basic scheme based on HFE and describe a new attack on HFEz, a cryptosystem based on special polynomials over finite fields with a modification, which discards a portion of the output from the initial transformation. This ensures a dependency on more variables while keeping the same size of the field. The attack starts with a translation of HFE into HFE with branches, followed by a branch separating algorithm described in [Fel06]. The separation algorithm uses the public key to derive an operation, which induces (with addition) a non-associative algebra. Utilising some properties of non-associative algebras, a matrix, which can separate variables into distinct sets according to branches, is calculated. This leads to stripping off the HFEz modification and thus allowing us to attack directly the HFE polynomial. Powered by TCPDF (www.tcpdf.org)
|
|
|
Classical structural attack on the Niederreiter cryptosystem based upon GRS codes
Hrubešová, Tereza ; Drápal, Aleš (advisor) ; Žemlička, Jan (referee)
The main purpose of this bachelor thesis is the description of the attack on the Niederreiter cryptosystem based on GRS codes. This attack was published by Sidelnikov and Shestakov in 1992. In the beginning the problem of group action, which is used in the attack, is introduced. A short preface into the coding theory follows, GRS codes are described and McEliece and Niederreiter cryptosystems are introduced, both as representatives of post-quantum cryptography. The following part of the thesis is dedicated to the attack itself. It is showed how one uses the group action, the process of the attack is also described in detail and its computing complexity is mentioned. Everything is illustrated by examples. Powered by TCPDF (www.tcpdf.org)
|
|
|
Goppa codes and their applications
Kotil, Jaroslav ; Drápal, Aleš (advisor) ; Šťovíček, Jan (referee)
Title: Goppa codes and their applications Author: Bc. Jaroslav Kotil Department: Department of algebra Supervisor: prof. RNDr. Aleš Drápal, CSc., DSc. Abstract: In this diploma paper we introduce Goppa codes, describe their para- metres and inclusion in Alternant codes, which are residual Generalized Reed- Solomon codes, and Algebraic-geometry codes. Aftewards we demonstrate deco- ding of Goppa codes and introduce Wild Goppa codes. We also describe post- quantum cryptography member: McEliece cryptosystem for which no effective attacks with quantum computers are known. We outline a usage of this crypto- system with Goppa codes and describe the security of the cryptosystem together with possible attacks of which the most effective ones are based on information- set decoding. Keywords: Goppa codes, Generalized Reed-Solomon codes, Algebraic-geometry codes, Post-quantum cryptography, McEliece cryptosystem 1
|
|
|
Post-quantum alternative to secure sockets
Behún, Marek ; Kratochvíl, Miroslav (advisor) ; Kofroň, Jan (referee)
The goal of this thesis is to implement a software library that provides a wrapping of real-time socket- like communication into an cryptographic protocol with purpose similar to SSL or TLS, that is secure against an adversary in possession of a quantum computer. Resulting software utilizes the Supersingular Isogeny Diffie Hellman (SIDH) key-exchange algorithm for achieving this level of security, and is simple, portable and independent on system-specific primitives. The thesis gives a concise introduction to the theory on which SIDH is built, targeting the audience of undergraduate students of Computer Science. Powered by TCPDF (www.tcpdf.org)
|
guest ::
