Many cryptographic primitives require random numbers, to be used as keys, challenges, unique identifiers, etc. However, generating random values on a computer is in fact a very difficult task. One possible method for such generation is to use a pseudo-random numbers generator.
A pseudo-random number generator (PRNG) is a function that, once initialized with some random value (called the seed), outputs a sequence that appears random, in the sense that an observer who does not know the value of the seed cannot distinguish the output from that of a (true) random bit generator.
It is important to note that a PRNG is a deterministic process: put back in the same state, it will reproduce the same sequence, as will two PRNGs initialized with the same seed. This property makes PRNGs suitable for use as stream ciphers.
Pseudo-random generators aimed for cryptographic applications must not be confused with those used for most other purposes (simulations, probabilistic algorithms, ...). Whereas...
This is a preview of subscription content, log in via an institution to check access.
References
Coron, J.-S. (1999). “On the security of random sources.” Proceedings of PKC'99, Lecture Notes in Computer Science, vol. 1560, eds. H. Imai and Y. Zheng. Springer-Verlag, Berlin.
Geffe, P. (1973). “How to protect data with ciphers that are really hard to break.” Electronics, 46, 99–101.
Knuth, D.E. (1997). The Art of Computer Programming (3rd. ed.). Computer Science and Information Processing, Vol. 2. Seminumerical Algorithms. Addison-Wesley, Reading, MA.
Maurer, U.M. (1992). “A universal statistical test for random bit generators.” Journal of Cryptology, 5 (2), 89–105.
Menezes, A.J., P.C. van Oorschot, and S.A. Vanstone, (1997). Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.
US Department of Commerce—National Institute of Standards and Technology (1994). FIPS 140-1: Security requirements for Cryptographic Modules, available at http://csrc.nist.gov/publications/fips/fips1401.pdf
US Department of Commerce (1999). FIPS 140-2: Security requirements for Cryptographic Modules (Draft), available at http://csrc.nist.gov/publications/fips/dfips140-2.pdf
Vazirani, U.V. and V.V. Vazirani (1985). “Efficient and secure pseudo-random number generation.” Advances in Cryptology—CRYPTO'84, Lecture Notes in Computer Science, vol. 196, eds. G.R. Blakley and D. Chaum. Springer, Berlin, 193–202.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Koeune, F. (2005). Pseudo-random number generator. In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_330
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_330
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering