Home // INTERNET 2011, The Third International Conference on Evolving Internet // View article

Class of Trustworthy Pseudo-Random Number Generators

Authors:
Jacques M. Bahi
Jean-François Couchot
Christophe Guyeux
Qianxue Wang

Keywords: Internet security; Chaotic sequences; Statistical tests; Discrete chaotic iterations

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.

Pages: 72 to 77

Copyright: Copyright (c) IARIA, 2011

Publication date: June 19, 2011

Published in: conference

ISSN: 2308-443X

ISBN: 978-1-61208-141-0

Location: Luxembourg City, Luxembourg

Dates: from June 19, 2011 to June 24, 2011