|
|
Cryptography protocol with public key
Fujdiak, Radek ; Rášo, Ondřej (referee) ; Mlýnek, Petr (advisor)
The Master thesis is an introduction to cryptology. The Thesis describe cryptosystems and selects one ideal cypher for low-power microcontroler. In thesis provides manual for instal development program COde Composer Studio, basic implementation of selected cryptosystem with small numbers and suggestion for implementation selected cyptosystem with big numbers.
|
|
|
Security design for system of remote quality measurement of electric power
Jakubíček, Michal ; Koutný, Martin (referee) ; Mlýnek, Petr (advisor)
Bachelor thesis in the first chapter deals with the concept of quality of electric power and its parameters. The next chapter is focused on systems that used remote data collection and the current direction of evolution of these systems. The third of the thesis discusses the symmetric and asymmetric cryptographic systems and their main representatives. The asymmetric system is described by the principle of calculating RSA and Diffie–Hellman. The next part deals with selected libraries that can count large numbers. Through the establishment of key using the Diffie–Hellman with these libraries and the subsequent measurement should be proved whether optimized library is faster than the other libraries. The evaluation of the used library in terms of speed and memory consumption is inculded in the final chapter. The appendix include installation instructions for the libraries BigDigits, GMP and OpenSSL in Visual Studio 2010.
|
|
|
Security design for system of remote quality measurement of electric power
Jakubíček, Michal ; Koutný, Martin (referee) ; Mlýnek, Petr (advisor)
Bachelor thesis in the first chapter deals with the concept of quality of electric power and its parameters. The next chapter is focused on systems that used remote data collection and the current direction of evolution of these systems. The third of the thesis discusses the symmetric and asymmetric cryptographic systéme and their main representatives. The asymmetric system is described by the principle of calculating RSA and Diffie–Hellman. The next part deals with selected libraries that can count large numbers. Through the establishment of key using the Diffie–Hellman with these libraries. The evaluation of the used library in terms of speed, number of elementary cycles and memory consumption is inculded in the chapter 5. The last chapter explains the optimization focused on Ultra-Low Power MCU and shown Montgomery multiplication and squaring. It describes in detail the procedure of calculation and described why is his calculation faster than conventional modular multiplication and exponentiation. The appendix include installation instructions for the libraries BigDigits, GMP and OpenSSL in Visual Studio 2010.
|
|
|
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.
|
|
|
Security design for system of remote quality measurement of electric power
Jakubíček, Michal ; Koutný, Martin (referee) ; Mlýnek, Petr (advisor)
Bachelor thesis in the first chapter deals with the concept of quality of electric power and its parameters. The next chapter is focused on systems that used remote data collection and the current direction of evolution of these systems. The third of the thesis discusses the symmetric and asymmetric cryptographic systems and their main representatives. The asymmetric system is described by the principle of calculating RSA and Diffie–Hellman. The next part deals with selected libraries that can count large numbers. Through the establishment of key using the Diffie–Hellman with these libraries and the subsequent measurement should be proved whether optimized library is faster than the other libraries. The evaluation of the used library in terms of speed and memory consumption is inculded in the final chapter. The appendix include installation instructions for the libraries BigDigits, GMP and OpenSSL in Visual Studio 2010.
|
|
|
Security design for system of remote quality measurement of electric power
Jakubíček, Michal ; Koutný, Martin (referee) ; Mlýnek, Petr (advisor)
Bachelor thesis in the first chapter deals with the concept of quality of electric power and its parameters. The next chapter is focused on systems that used remote data collection and the current direction of evolution of these systems. The third of the thesis discusses the symmetric and asymmetric cryptographic systéme and their main representatives. The asymmetric system is described by the principle of calculating RSA and Diffie–Hellman. The next part deals with selected libraries that can count large numbers. Through the establishment of key using the Diffie–Hellman with these libraries. The evaluation of the used library in terms of speed, number of elementary cycles and memory consumption is inculded in the chapter 5. The last chapter explains the optimization focused on Ultra-Low Power MCU and shown Montgomery multiplication and squaring. It describes in detail the procedure of calculation and described why is his calculation faster than conventional modular multiplication and exponentiation. The appendix include installation instructions for the libraries BigDigits, GMP and OpenSSL in Visual Studio 2010.
|
|
|
Cryptography protocol with public key
Fujdiak, Radek ; Rášo, Ondřej (referee) ; Mlýnek, Petr (advisor)
The Master thesis is an introduction to cryptology. The Thesis describe cryptosystems and selects one ideal cypher for low-power microcontroler. In thesis provides manual for instal development program COde Composer Studio, basic implementation of selected cryptosystem with small numbers and suggestion for implementation selected cyptosystem with big numbers.
|
|
|
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 ::
