arXiv · 1112.0950
Class of Trustworthy Pseudo-Random Number Generators
Abstract
With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information hiding schemes. One of the existing chaos-based PRNGs is using chaotic iterations schemes. In prior literature, the iterate function is just the vectorial boolean negation. In this paper, we propose a method using Graph with strongly connected components as a selection criterion for chaotic iterate function. In order to face the challenge of using the proposed chaotic iterate functions in PRNG, these PRNGs are subjected to a statistical battery of tests, which is the well-known NIST in the area of cryptography.
Explore related subjects
Keep this discovery
Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Qianxue Wang. 2011-12-05. Class of Trustworthy Pseudo-Random Number Generators. https://arxiv.org/abs/1112.0950
Cite the original work for its findings. Save a collection to share your selection of sources.