Truly random number generation: an example

Randomness is crucial for a variety of applications, ranging from gambling to computer simulations, and from cryptography to statistics. However, many of the currently used methods for generating randomness do not meet the criteria that are necessary for these applications to work properly and safely. A common problem is that a sequence of numbers may look random but nevertheless not be truly random. In fact, the sequence may pass all standard statistical tests and yet be perfectly predictable. This renders it useless for many applications. For example, in cryptography, the predictability of a randomly" chosen password is obviously undesirable. Here, we review a recently developed approach to generating true | and hence unpredictable | randomness.

[1]  Douglas R Stinson,et al.  Universal hash families and the leftover hash lemma, and applications to cryptography and computing , 2010 .

[2]  Gilles Brassard,et al.  Quantum Cryptography , 2005, Encyclopedia of Cryptography and Security.

[3]  Leonid A. Levin,et al.  Pseudo-random generation from one-way functions , 1989, STOC '89.

[4]  L. Fortnow,et al.  Recent Developments in Explicit Constructions of Extractors , 2002, Bull. EATCS.

[5]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[6]  Gilles Brassard,et al.  Privacy Amplification by Public Discussion , 1988, SIAM J. Comput..

[7]  Arjen K. Lenstra,et al.  Public Keys , 2012, CRYPTO.

[8]  Roger Colbeck,et al.  Free randomness can be amplified , 2011, Nature Physics.

[9]  David Zuckerman,et al.  General weak random sources , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[10]  A. Rollett,et al.  The Monte Carlo Method , 2004 .

[11]  Huang Zhun,et al.  A truly random number generator based on thermal noise , 2001, ASICON 2001. 2001 4th International Conference on ASIC Proceedings (Cat. No.01TH8549).