How to get truly random data, not random data fed into a PRNG seed like CSRNG’s do?

by

As you know, “truly random” means each of the bits is independent of everything else as well as uniformly distributed. However, this ideal is hard, if not impossible, to achieve in practice. In general, the closest way to get “truly random data” in practice is to gather hard-to-guess bits from nondeterministic sources, then condense those bits into a random block of data.

There are many issues involved with getting this close to “truly random data”, including the following:

  1. The sources must be nondeterministic, that is, their output cannot be determined by their inputs. Examples of nondeterministic sources include timings of input devices; thermal noise; and the noise registered by microphone and camera outputs.
  2. The sources’ output must be hard to guess. This is more formally known as entropy, such as 32 bits of entropy per 64 bits of output. However, measuring entropy is far from trivial. If you need 1 MB (8 million bits) of truly random data, you need to have data with at least 8 million bits of entropy (which in practice will be many times more than 1 MB long depending on the sources), then condense the data somehow into 1 MB of data while preserving that entropy.
  3. The sources must be independent of each other.
  4. There should be two or more independent sources. This is because it’s impossible to extract full randomness from just one source (see McInnes and Pinkas 1990). On the other hand, extracting randomness from three or more independent sources is relatively trivial, but there is still a matter of choosing an appropriate randomness extractor, and a survey of randomness extractors would be beyond the scope of this answer.

In general, for random number generation purposes, the more sources available, the better.

REFERENCES:

  • McInnes, J. L., & Pinkas, B. (1990, August). On the impossibility of private key cryptography with weakly random keys. In Conference on the Theory and Application of Cryptography (pp. 421-435).

More Related Contents:

  1. Java program that ask the user to enter the number of random values they wish to generate
  2. Getting N random numbers whose sum is M
  3. How many random elements before MD5 produces collisions?
  4. Random / noise functions for GLSL
  5. Difference between java.util.Random and java.security.SecureRandom
  6. How to generate a random integer in the range [0,n] from a stream of random bits without wasting bits?
  7. How many double numbers are there between 0.0 and 1.0?
  8. Non-repetitive random number in numpy
  9. Crash when casting the result of arc4random() to Int
  10. Is Math.random() cryptographically secure?
  11. Why use the C# class System.Random at all instead of System.Security.Cryptography.RandomNumberGenerator?
  12. What is the most secure seed for random number generation?
  13. How does a random number generator work?
  14. Why are my random numbers always the same?
  15. How can I create a random number that is cryptographically secure in python?
  16. Generating uniform random numbers in Lua
  17. How can I get a random number in Kotlin?
  18. Do stateless random number generators exist?
  19. Lua math.random not working
  20. How does a cryptographically secure random number generator work?
  21. Random order & pagination Elasticsearch
  22. how to generate integer random number in fortran 90 in the range [0,5]?
  23. How to properly seed random number generator
  24. random unit vector in multi-dimensional space
  25. How do I create a random String by sampling from alphanumeric characters?
  26. Generate random numbers according to distributions
  27. How to test random numbers?
  28. how does random() actually work?
  29. SecureRandom with NativePRNG vs SHA1PRNG
  30. How random is crypto#randomBytes?

Leave a Comment