Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU

Details Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU

2011-12-22

arxiv.org/abs/1112.5239v1

Computer Science

Cryptography and Security

Scientific paper

In this paper we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven to be chaotic according to the Devaney's formulation. We thus propose an efficient implementation for GPU that successfully passes the BigCrush tests, deemed to be the hardest battery of tests in TestU01. Experiments show that this PRNG can generate about 20 billion of random numbers per second on Tesla C1060 and NVidia GTX280 cards. It is then established that, under reasonable assumptions, the proposed PRNG can be cryptographically secure. A chaotic version of the Blum-Goldwasser asymmetric key encryption scheme is finally proposed.

Affiliated with

Also associated with

No associations

Rating

Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU 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 Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305956