Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU
arXiv:1112.5239v1 [cs.CR] (22 Dec 2011)
@article{2011arXiv1112.5239B,
author={Bahi}, J.~M. and {Couturier}, R. and {Guyeux}, C. and {H{‘e}am}, P.-C.},
title={"{Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1112.5239},
primaryClass={"cs.CR"},
keywords={Computer Science – Cryptography and Security},
year={2011},
month={dec},
adsurl={http://adsabs.harvard.edu/abs/2011arXiv1112.5239B},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
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.
December 23, 2011 by hgpu
