Period lengths of chaotic pseudo-random number generators

Authors:
Jörg Keller;Hanno Wiese
Affiliations:
Fern Universität in Hagen, LG Parallelität und VLSI, Hagen, Germany;Fern Universität in Hagen, LG Parallelität und VLSI, Hagen, Germany
Venue:
CNIS '07 Proceedings of the Fourth IASTED International Conference on Communication, Network and Information Security
Year:
2007

Citing 3
Cited 0

Random mapping statistics

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A universal statistical test for random bit generators

Journal of Cryptology
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cryptographic communication protocols frequently employ random numbers to achieve desirable properties. Often, generators for pseudo-random numbers (PRNGs) are employed. A class of PRNGs that currently gains popularity are chaotic PRNGs which are derived from chaotic systems in physics. While their mathematical properties make them promising, typical implementations of such generators use IEEE 754 floating point representations instead of real numbers. We show that this leads to periods that are much shorter than expected, and thus renders these PRNGs potentially insecure.