29 October 2013 Truly random number generation: an example
Author Affiliations +
Abstract
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniela Frauchiger, Renato Renner, "Truly random number generation: an example", Proc. SPIE 8899, Emerging Technologies in Security and Defence; and Quantum Security II; and Unmanned Sensor Systems X, 88990S (29 October 2013); doi: 10.1117/12.2032183; https://doi.org/10.1117/12.2032183
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Photon statistics: math versus mysticism
Proceedings of SPIE (October 01 2013)
Towards a high-speed quantum random number generator
Proceedings of SPIE (October 29 2013)
Experimental E91 quantum key distribution
Proceedings of SPIE (February 19 2008)
Quantum Gaussian noise
Proceedings of SPIE (May 16 2003)
Deterministic minimum disturbance quantum measurement
Proceedings of SPIE (September 05 2008)

Back to Top