Investigation of Pseudo-Random Generators

OData support
Supervisor:
Dr. Szabó Csaba Attila
Department of Networked Systems and Services

There are many times when solving engineering, natural

sciences and economic and other problems that need random sequences, generated by fundamentally deterministic operated computers.

In the present MSC thesis, we examine how can a digital computer (operating in a deterministic way) generate pseudorandom number sequences with the statistical properties approximating the series of true random.

We review the most important classical solutions and approaches in the literature of these related problems.

Brief Description of the target hardware using random number generation methods.

We present an approach based on complexity theory, and some of the newer method, the necessary mathematical methods together.

We present the generated random number sequences of measuring methods.

We discuss a possible interpretation of the concept of random as well.

We present a self-made implementation, which can then be used to generate pseudo-random sequences and parameters can be set with a convenient user interface.

Downloads

Please sign in to download the files of this thesis.