Class of Trustworthy Pseudo-Random Number Generators

Details Class of Trustworthy Pseudo-Random Number Generators Class of Trustworthy Pseudo-Random Number Generators

2011-12-05

arxiv.org/abs/1112.0950v1

Computer Science

Cryptography and Security

6 pages, 3 figures, In INTERNET 2011, the 3-rd Int. Conf. on Evolving Internet, Luxembourg, Luxembourg, pages 72--77, June 201

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Class of Trustworthy Pseudo-Random Number Generators does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Class of Trustworthy Pseudo-Random Number Generators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Class of Trustworthy Pseudo-Random Number Generators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395893