Cryptographically Secure Pseudorandom Number Generators
Cryptographically secure pseudorandom number generators (CSPRNGs) are pseudorandom number generators that protect against attack while still providing high quality pseudorandom values. In this chapter, we explore four of these generators, one for historical purposes (Blum Blum Shub) and three that are considered secure and are in current use: ISAAC, Fortuna, and ChaCha20.
- 1.Schneier, Bruce. Applied cryptography: protocols, algorithms, and source code in C. john wiley & sons, 2015.Google Scholar
- 2.Andrew Chi-Chih Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, 1982.Google Scholar
- 3.Goldberg, Ian, and David Wagner. “Randomness and the Netscape browser.” Dr Dobb’s Journal-Software Tools for the Professional Programmer 21, no. 1 (1996): 66–71.Google Scholar
- 4.Dorrendorf, Leo, Zvi Gutterman, and Benny Pinkas. “Cryptanalysis of the random number generator of the windows operating system.” ACM Transactions on Information and System Security (TISSEC) 13, no. 1 (2009): 10.Google Scholar
- 5.Lenstra, Arjen, James P. Hughes, Maxime Augier, Joppe Willem Bos, Thorsten Kleinjung, and Christophe Wachter. “Ron was wrong, Whit is right.” (2012).Google Scholar
- 6.Heninger, Nadia, Zakir Durumeric, Eric Wustrow, and J. Alex Halderman. “Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices.” In USENIX Security Symposium, vol. 8. 2012.Google Scholar
- 8.Gauss, Carl Friedrich. Disquisitiones arithmeticae. Vol. 157. Yale University Press, 1966.Google Scholar
- 11.Jenkins, Robert J. “Isaac.” In International Workshop on Fast Software Encryption, pp. 41–49. Springer, Berlin, Heidelberg, 1996.Google Scholar
- 12.Paul, Souradyuti, and Bart Preneel. “On the (in) security of stream ciphers based on arrays and modular addition.” In ASIACRYPT, vol. 6. 2006.Google Scholar
- 13.Aumasson, Jean-Philippe. “On the pseudo-random generator ISAAC.” IACR Cryptology ePrint Archive 2006 (2006): 438.Google Scholar
- 14.Pudovkina, Marina. “A known plaintext attack on the ISAAC keystream generator.” IACR Cryptology ePrint Archive 2001 (2001): 49.Google Scholar
- 16.McEvoy, Robert, James Curran, Paul Cotter, and Colin Murphy. “Fortuna: cryptographically secure pseudo-random number generation in software and hardware.” (2006): 457–Z462.Google Scholar
- 17.Bernstein, Daniel J. “The ChaCha family of stream ciphers.” DJ Bernstein’s Webpage. https://cr.yp.to/chacha.html.