ON CONSTRUCTIVE APPROACH TO CHAOTIC PSEUDORANDOM NUMBER GENERATORS

Zbigniew Kotulski, Karol Górski, Anna Górska, Andrzej Paszkiewicz

2000 · 26 citations · 14 references

Concepts

Abstract

Among pseudorandom number generators widely used in engineering applications, Chaotic Pseudorandom Number Generators (CPRNG) have particularly attractive properties which guarantee the uniqueness of the generated sequences for any chosen seed and the independence of the generated numbers along the obtained trajectory (the sequence). These properties can be rigorously mathematically proved for a wide class of chaotic dynamical systems. The appropriate theorems can be found in the previous paper of the authors (Szczepanski et al.1999a). In this paper we develop the results obtained in (Szczepanski et al.1999a) and present a class of generators based on the so-called solvable (constructible) chaotic dynamical systems. In this case the elements of the chaotic sequence can be represented in an iterative way and, alternatively, as certain functions of the argument n. We study the effectiveness of the practical application of such systems for generation of sequences of pseudorandom numbers and investigate the properties of the obtained data to confirm the validity of the proposed algorithm for cryptographic purposes.

References

14