|
Random Numbers Generator with Selected Distribution
Kajan, Michal ; Martínek, Tomáš (referee) ; Kořenek, Jan (advisor)
This thesis describes random numbers generating techniques. First part focuses on methods of obtaining pseudorandom numbers and presents typical examples of random numbers generators. This part also contains description of distribution transformation methods of random numbers and briefly deals with testing of statistical properties of random numbers generators. Following part describes LFSR generator in detail as one of most widely used generators for hardware applications. In addition, description of transformation process and implementation of circuit calculating transformation to the exponential distribution is included. Last part contains resources requierements of designed circuits for implementation in FPGA.
|
|
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.
|
|
Genetic Algorithms and Scheduling
Škrabal, Ondřej ; Popela, Pavel (referee) ; Roupec, Jan (advisor)
This work deals with scheduling problem in particular plastic production service. The solution is based on heuristic algorithms, programming languages C + +, C # and is built on the .NET framework and LINQ to XML. It provides the users with comparisons of the heuristic approach with genetic algorithms applied to production problem. All methods results are compared in relation to hand-arranged plans.
|
|
Rabdom number generators
Mikulka, Zdeněk ; Schimmel, Jiří (referee) ; Zeman, Václav (advisor)
This thesis concerns with methods of pseudorandom numbers generation. It focus on software generators. There are pseudorandom number generators divided according to the way of generation and described single types. The next part describes methods of testing for quality of random and pseudorandom number generators. They are divided into theoretical and statistical tests. Some of these tests are used on available generators. The evaluation is based on results of these tests.
|
|
Programs for calculating measurement uncertainty using Monte Carlo method
Novotný, Marek ; Havlíková, Marie (referee) ; Šedivá, Soňa (advisor)
The thesis deals with establishing uncertainties of indirect measurements. It focuses primarily on random number generators in software enabling the calculation of mea-surement uncertainties using Monte Carlo. Then it focuses on the uncertainty calculati-on indirect measurement as the Monte Carlo method and the classical numerical met-hod. The practical part deals with the verification of randomness generators numbers contained in various softwares. It also deals with the determination of uncertainties indi-rect current measurements by both above-mentioned methods and then comparing and evaluating the values achieved.
|
|
Random number generator
Zouhar, Petr ; Martinásek, Zdeněk (referee) ; Sobotka, Jiří (advisor)
The thesis deals with issues of random numbers, their generating and use in cryptography. Introduction of work is aimed to resolution of random number generators and pseudo--random number generators. There is also included often used dividing generators on software and hardware. We mention advantages and disadvantages of each type and area of their use. Then we describe examples of random and pseudorandom numbers, mainly hardware based on physical phenomenon such as the decay of radioactive material or use atmospheric noise. The following part is devoted to suggestion own random number generator and a description of its functionality. In the second half of the work we devote to the field of cryptography. We know basic types of cryptographic systems, namely symmetric and asymmetric cryptosystems. We introduce a typical representant the various type and their properties. At the end of the work we again return to our random number generator and verify the randomness generated numbers and obtained cryptograms.
|