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.
Cite
@article{arxiv.1112.0950,
title = {Class of Trustworthy Pseudo-Random Number Generators},
author = {Jacques M. Bahi and Jean-François Couchot and Christophe Guyeux and Qianxue Wang},
journal= {arXiv preprint arXiv:1112.0950},
year = {2011}
}
Comments
6 pages, 3 figures, In INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet, Luxembourg, Luxembourg, pages 72--77, June 2011