On Constructive Approach To Chaotic Pseudorandom Number Generators
Zbigniew Kotulski , Janusz Szczepański , Karol Górski , Anna Górska , Andrzej Paszkiewicz
AbstractAmong 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 (Szczepański et al.1999a). In this paper we develop the results obtained in (Szczepański 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.
|Book||Proceedings of Regional Conference on Military Communication and Information Systems 2000: Partnership for CIS Interoperability, 2000, Wojskowy Instytut Łączności, 700 p.|
|Keywords in English||Pseudorandom number generators, stream ciphers, dynamical systems, chaos, ergodicity, solvable chaotic systems, statistical tests.|
|Publication indicators||= 45.0|
|Citation count*||45 (2020-09-05)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.