Pseudo-random number generator based on irrational numbers

Pseudo-random number generators (PRNGs) are used in many applications (cryptography, traffic simulations, etc.) and have significant influence on their performances. In this paper, the PRNG based on irrational numbers will be introduced. It will be proved that under the given set of conditions the maximum period of the generated sequence can be guaranteed. Then, the proposed PRNG implementation will be presented and discussed. It will be shown that the generated numbers are uncorrelated. Also, the influence that the finite number of digits used to represent the irrational numbers in computer systems has on the period of the generated sequence will be analyzed.