|
|
Safe Cryptography Algorithms
Mahdal, Jakub ; Hanáček, Petr (referee) ; Chmelař, Petr (advisor)
This thesis brings a reader an overview about historical and modern world of cryptographic methods, as well evaluates actual state of cryptographic algorithm progressions, which are used in applications nowadays. The aim of the work describes common symmetric, asymmetric encryption methods, cryptographic hash functions and as well pseudorandom number generators, authentication protocols and protocols for building VPNs. This document also shows the basics of the successful modern cryptanalysis and reveals algorithms that shouldn't be used and which algorithms are vulnerable. The reader will be also recommended an overview of cryptographic algorithms that are expected to stay safe in the future.
|
|
|
Generating the Pseudo-Random Numbers
Štulír, Vojtěch ; Hrubý, Martin (referee) ; Grulich, Lukáš (advisor)
This bachelor's thesis is about pseudorandom generators which are used for computers technology. It is written in different kinds of these generators and their working principle. And also this thesis deals with analysis transformation of generated number sequence on others. One part is studied testing and define consequent quality of number sequence. Last part of this thesis is shown my own implementation of something part in text.
|
|
|
Entropic random number generator
Kukko, Marcel ; Zeman, Václav (referee) ; Burda, Karel (advisor)
The paper is focused on the random number generation by personal computer. It describes the most widely used types of random sequence generators and methods for their testing. The second part is focused on the design of the generator and an analysis of its testing.
|
|
|
Hardware generation of cryptographic-safe primes.
Kabelková, Barbora ; Smékal, David (referee) ; Cíbik, Peter (advisor)
The bachelor's thesis deals with the topic of prime numbers and their generation. It briefly introduces prime numbers and points out the importance of secure primes in cryptography. It gives examples of asymmetric ciphers and closely analyses RSA algorithm. The thesis then presents some pseudo-random and true-random methods of generating sequences of numbers and compares their properties. It evaluates the most used primality tests, both probabilistic and real, based on their applicability in practice. It suggests several combinations of primality tests with generating methods and chooses one to implement on FPGA. The thesis describes the implementation of a generator that generates a sequence of numbers using the von Neumann middle-square method and subsequently uses the Miller-Rabin test to find primes between those numbers. Key processes of the proposed generator are explained and illustrated. The proposed implementation is simulated and synthesized in the Xilinx Viavado environment. The individual parts of the generator are tested using several behavioral simulations. Finally, the thesis comments on the conducted simulations and evaluates the properties of the proposed implementation.
|
|
|
Random number generators evaluation
Svoboda, Martin ; Sikora, Marek (referee) ; Zeman, Václav (advisor)
The topic of the thesis is random numbers and the problem of their testing. The thesis presents methods of generating random numbers and many statistical tests of randomness. Part of the work is a description of an application created for testing random numbers, which contains a set of 23 statistical tests of randomness and 5 integrated generators. In the last chapter, various types of generators and keys created by quantum key distribution are tested using the application.
|
|
|
Hardware generation of cryptographic-safe primes.
Kabelková, Barbora ; Smékal, David (referee) ; Cíbik, Peter (advisor)
The bachelor's thesis deals with the topic of prime numbers and their generation. It briefly introduces prime numbers and points out the importance of secure primes in cryptography. It gives examples of asymmetric ciphers and closely analyses RSA algorithm. The thesis then presents some pseudo-random and true-random methods of generating sequences of numbers and compares their properties. It evaluates the most used primality tests, both probabilistic and real, based on their applicability in practice. It suggests several combinations of primality tests with generating methods and chooses one to implement on FPGA. The thesis describes the implementation of a generator that generates a sequence of numbers using the von Neumann middle-square method and subsequently uses the Miller-Rabin test to find primes between those numbers. Key processes of the proposed generator are explained and illustrated. The proposed implementation is simulated and synthesized in the Xilinx Viavado environment. The individual parts of the generator are tested using several behavioral simulations. Finally, the thesis comments on the conducted simulations and evaluates the properties of the proposed implementation.
|
|
|
Entropic random number generator
Kukko, Marcel ; Zeman, Václav (referee) ; Burda, Karel (advisor)
The paper is focused on the random number generation by personal computer. It describes the most widely used types of random sequence generators and methods for their testing. The second part is focused on the design of the generator and an analysis of its testing.
|
|
|
Generating the Pseudo-Random Numbers
Štulír, Vojtěch ; Hrubý, Martin (referee) ; Grulich, Lukáš (advisor)
This bachelor's thesis is about pseudorandom generators which are used for computers technology. It is written in different kinds of these generators and their working principle. And also this thesis deals with analysis transformation of generated number sequence on others. One part is studied testing and define consequent quality of number sequence. Last part of this thesis is shown my own implementation of something part in text.
|
|
|
Safe Cryptography Algorithms
Mahdal, Jakub ; Hanáček, Petr (referee) ; Chmelař, Petr (advisor)
This thesis brings a reader an overview about historical and modern world of cryptographic methods, as well evaluates actual state of cryptographic algorithm progressions, which are used in applications nowadays. The aim of the work describes common symmetric, asymmetric encryption methods, cryptographic hash functions and as well pseudorandom number generators, authentication protocols and protocols for building VPNs. This document also shows the basics of the successful modern cryptanalysis and reveals algorithms that shouldn't be used and which algorithms are vulnerable. The reader will be also recommended an overview of cryptographic algorithms that are expected to stay safe in the future.
|
guest ::
