Abstract
It's not easy to generate a string of numbers that lack any pattern or rule, or even to define exactly what randomness means.
- Barker, E. and Kelsey, J. Recommendation for random number generation using deterministic random bit generators (revised), NIST Special Publication 800-90, U.S. National Institute of Standards and Technology, March 2007.Google Scholar
- Blum, M. and Micali, S. How to generate cryptographically strong sequences of pseudorandom bits, SIAM Journal on Computing 13, 4, November 1984. Google ScholarDigital Library
- Menezes, A., van Oorschot, P., and Vanstone, S. Pseudorandom bits and sequences, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1996. Google ScholarDigital Library
- Rukhin, A, Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., and Vo, S. A statistical test suite for random and pseudorandom number generators for cryptographic applications, NIST Special Publication 800-22, U.S. National Institute of Standards and Technology, April 2010.Google Scholar
- Srinivasan, S., Mathew, S., Ramanarayanan, R., Sheikh, F., Anders, M., Kaul, H., Erraguntla, V., Krishnamurthy, R., and Taylor, G. 2.4GHz 7mW all-digital PVT-variation tolerant true random number generator in 45nm CMOS, 2010 IEEE Symposium on VLSI Circuits, Honolulu, HI, June 16-18, 2010.Google ScholarCross Ref
Index Terms
- The quest for randomness
Recommendations
When does randomness come from randomness?
A result of Shen says that if F : 2 N ź 2 N is an almost-everywhere computable, measure-preserving transformation, and y ź 2 N is Martin-Löf random, then there is a Martin-Löf random x ź 2 N such that F ( x ) = y . Answering a question of Bienvenu and ...
Extracting Randomness
Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related “dispersers,” exhibit some of the most “...
Hardness vs. randomness
SFCS '88: Proceedings of the 29th Annual Symposium on Foundations of Computer ScienceA simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...
Comments