|
|
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.
|
|
|
True random number generator
Procházková, Lenka ; Burda, Karel (referee) ; Člupek, Vlastimil (advisor)
The goal of this bachelor thesis is to apprise with true random number generators and their realisation. At first, random numbers and true random number generators are described and principles, details and properties are explained. The thesis also describes the use of generators in computers and in IoT devices and random sequences testing. The part of this thesis is description and realisation of computer generator and description of smartphone generator. The source of entropy used in this work is cursor move. Generated sequences were tested by the NIST STS and compared with sequences from other generators.
|
|
|
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.
|
|
|
True random number generator
Procházková, Lenka ; Burda, Karel (referee) ; Člupek, Vlastimil (advisor)
The goal of this bachelor thesis is to apprise with true random number generators and their realisation. At first, random numbers and true random number generators are described and principles, details and properties are explained. The thesis also describes the use of generators in computers and in IoT devices and random sequences testing. The part of this thesis is description and realisation of computer generator and description of smartphone generator. The source of entropy used in this work is cursor move. Generated sequences were tested by the NIST STS and compared with sequences from other generators.
|
|
|
Návrh a implementace generátoru náhodných čísel
PECKA, Stanislav
This diploma thesis deals with creation of several random number generators. The data from these prototypes are then compared according to various aspects and statistical methods. The reader is familiar with the basic concepts, the existing random number generators and the technologies used.
|
guest ::
