Skip to main content
SpringerLink
Log in

Pseudorandom Number Generator

  • Reference work entry
Encyclopedia of Cryptography and Security

Synonyms

PRNG

Related concepts

Blum–Blum–Shub Pseudorandom Bit Generator; Linear Feedback Shift Register; Random Bit Generator; Random Number Generators; Stream Cipher

Definition

A pseudorandom 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.

Background

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 pseudorandom numbers generator.

Theory

To formalize the definition, consider the following “distinguishing” experiment. Let G be a generator that, given a seed input s, outputs a (longer) string G(s). Consider also a polynomial-time algorithm Athat is given...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Coron JS (1999) On the security of random sources. In: Proceedings of PKC ’99 (Berlin)., vol 1560. Springer, Heidelberg

    Google Scholar 

  2. Hastad J, Impagliazzo R, Levin LA, Luby M (1999) A pseudorandom generator from any one-way function. SIAM J Comput 28:12–24

    MathSciNet  Google Scholar 

  3. Knuth DE (1997) The art of computer programming. Seminumerical algorithms, vol 2. 3rd edn. Computer science and information processing. Addison-Wesley, Reading

    Google Scholar 

  4. Maurer UM (1992) A universal statistical test for random bit generators. J Cryptol 5(2):89–105

    MATH  MathSciNet  Google Scholar 

  5. Goldreich O (2001) Foundations of cryptography: vol 1 (Basic tools). Cambridge University Press, Cambridge, ISBN 0521670527, 9780521670524

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microelectronics Laboratory, Université catholique de Louvain, Place du Levant, 3, B-1348, Louvain-la-Neuve, Belgium

    François Koeune

Authors
  1. François Koeune
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    Henk C. A. van Tilborg

  2. Center for Secure Information Systems, George Mason University, Fairfax, VA, 22030-4422, USA

    Sushil Jajodia

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Koeune, F. (2011). Pseudorandom Number Generator. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_131

Download citation

Publish with us

Policies and ethics

Search

Navigation