|
|
Alternative methods in cryptology
Hampl, Dalibor ; Doležel, Radek (referee) ; Hajný, Jan (advisor)
In the first part of this thesis explains, what is generally cryptography, generally analyze the problem of the current encryption methods. These include asymmetric, symmetric and hybrid encryption methods. The second part focuses on the theory of lattices and their main mathematical problems, then the shortest vector problem, the closest vector problem, the approximate shortest vector problem and the approximate closest vector problem. Mathematically difficult problems of lattice are used in an encryption method GGH for asymmetrically encrypted communications method and GGH for digital signatures. It explains mathematical methods, which use these encryption methods. Another part of this thesis deals with the encryption method and the establishment of XTR on Diffie-Hellman protocol, thus XTR-DH. It explains mathematical methods, which use methods XTR, XTR-DH and Diffie-Hellman protocol. There are shown the main mathematical problems for this part of thesis DHP (Diffie-Hellman problem) and DLP (discrete logarithm problem). The fourth part focuses on a program designed to demonstrate the GGH encryption method for asymmetrically encrypted communications. Describes the structure, functionality, graphical part of the program and shows to a user interface. Students can test how the GGH encryption method behave when entering different input values. During the work with the program, the user should obtain sufficient information to understand the principles of this encryption method.
|
|
|
System for anonymous transmit of messages
Kislinger, Jan ; Rosenberg, Martin (referee) ; Ležák, Petr (advisor)
Diploma thesis deals with an anonymous transmit of messages using protocol for anonymous authentication. In first part, we introduce theoretical familiarization to the issues and description protocol for anonymous authentication. Further, it describes the suggestion of the communication between the client and the server. Finally, contains a description of the created system for anonymous transmit of messages, which consists of the server and clients, who can leave challenges on the server for other users and they obtains challenges from the server. The thesis explains how to start and control program. There are also discussed methods of computing verification values, encryption keys and messages and authentication of receivers.
|
|
|
Software support for cryptography system training based on discrete logarithm
Kříž, Jiří ; Zeman, Václav (referee) ; Burda, Karel (advisor)
Current needs of human communication came to status, when most of transferred messages are considered as private and transition over non-secured communication lines in open form is not possible. That originated a lot of different methods for securing of messages and transfers in ciphered form. Two mainstreams were established, symmetric cryptography and asymmetric cryptography. Second of mentioned groups is based on usage of two information – keys, when one of then is broadly known and is public and second, well protected and private. Using a public key it is possible to establish a cryptogram of message, but for deciphering it is necessary to know private key. Asymmetric methods are based on mathematical problems, for which there is not an effective computing algorithm. This thesis are focused for asymmetric cryptosystems based on discrete logarithm problem, where ciphering of message using public key is very easy and quick, but deciphering without knowledge of private key is extremely time consuming process. Work describes a mathematical base of discrete logarithm problem, its’ properties and methods developed for solving of this problem. Descriptions of particular cryptosystems are given, i.e. ElGamal cryptosystem, Diffie-Hellman protocol and DSA. Second part of thesis is focused for web application developed as study support of discrete logarithm problem and of cryptosystems using this problem. It describes functional and graphical interface, work with it and options given to user working with application. Mentions also lessons for user which should help with understanding of described problems and practicing.
|
|
|
Alternative methods in cryptology
Hampl, Dalibor ; Doležel, Radek (referee) ; Hajný, Jan (advisor)
In the first part of this thesis explains, what is generally cryptography, generally analyze the problem of the current encryption methods. These include asymmetric, symmetric and hybrid encryption methods. The second part focuses on the theory of lattices and their main mathematical problems, then the shortest vector problem, the closest vector problem, the approximate shortest vector problem and the approximate closest vector problem. Mathematically difficult problems of lattice are used in an encryption method GGH for asymmetrically encrypted communications method and GGH for digital signatures. It explains mathematical methods, which use these encryption methods. Another part of this thesis deals with the encryption method and the establishment of XTR on Diffie-Hellman protocol, thus XTR-DH. It explains mathematical methods, which use methods XTR, XTR-DH and Diffie-Hellman protocol. There are shown the main mathematical problems for this part of thesis DHP (Diffie-Hellman problem) and DLP (discrete logarithm problem). The fourth part focuses on a program designed to demonstrate the GGH encryption method for asymmetrically encrypted communications. Describes the structure, functionality, graphical part of the program and shows to a user interface. Students can test how the GGH encryption method behave when entering different input values. During the work with the program, the user should obtain sufficient information to understand the principles of this encryption method.
|
|
|
System for anonymous transmit of messages
Kislinger, Jan ; Rosenberg, Martin (referee) ; Ležák, Petr (advisor)
Diploma thesis deals with an anonymous transmit of messages using protocol for anonymous authentication. In first part, we introduce theoretical familiarization to the issues and description protocol for anonymous authentication. Further, it describes the suggestion of the communication between the client and the server. Finally, contains a description of the created system for anonymous transmit of messages, which consists of the server and clients, who can leave challenges on the server for other users and they obtains challenges from the server. The thesis explains how to start and control program. There are also discussed methods of computing verification values, encryption keys and messages and authentication of receivers.
|
|
|
Software support for cryptography system training based on discrete logarithm
Kříž, Jiří ; Zeman, Václav (referee) ; Burda, Karel (advisor)
Current needs of human communication came to status, when most of transferred messages are considered as private and transition over non-secured communication lines in open form is not possible. That originated a lot of different methods for securing of messages and transfers in ciphered form. Two mainstreams were established, symmetric cryptography and asymmetric cryptography. Second of mentioned groups is based on usage of two information – keys, when one of then is broadly known and is public and second, well protected and private. Using a public key it is possible to establish a cryptogram of message, but for deciphering it is necessary to know private key. Asymmetric methods are based on mathematical problems, for which there is not an effective computing algorithm. This thesis are focused for asymmetric cryptosystems based on discrete logarithm problem, where ciphering of message using public key is very easy and quick, but deciphering without knowledge of private key is extremely time consuming process. Work describes a mathematical base of discrete logarithm problem, its’ properties and methods developed for solving of this problem. Descriptions of particular cryptosystems are given, i.e. ElGamal cryptosystem, Diffie-Hellman protocol and DSA. Second part of thesis is focused for web application developed as study support of discrete logarithm problem and of cryptosystems using this problem. It describes functional and graphical interface, work with it and options given to user working with application. Mentions also lessons for user which should help with understanding of described problems and practicing.
|
guest ::
