2011/12/22 by Raphaël Couturier, Bahi, Jacques M., Couturier, Raphaël +5
Computer Science · Physics and Astronomy · #Advanced Mathematical Theories and Applications #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1112.5239
openalex publication_date 2011/12/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we present a new pseudorandom number generator (PRNG) on\ngraphics processing units (GPU). This PRNG is based on the so-called chaotic\niterations. It is firstly proven to be chaotic according to the Devaney's\nformulation. We thus propose an efficient implementation for GPU that\nsuccessfully passes the BigCrush tests, deemed to be the hardest battery of\ntests in TestU01. Experiments show that this PRNG can generate about 20 billion\nof random numbers per second on Tesla C1060 and NVidia GTX280 cards. It is then\nestablished that, under reasonable assumptions, the proposed PRNG can be\ncryptographically secure. A chaotic version of the Blum-Goldwasser asymmetric\nkey encryption scheme is finally proposed.\n