Share Email Print
cover

Proceedings Paper

Truly random number generation: an example
Author(s): Daniela Frauchiger; Renato Renner
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 29 October 2013
PDF: 7 pages
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
Show Author Affiliations
Daniela Frauchiger, ETH Zürich (Switzerland)
Renato Renner, ETH Zürich (Switzerland)


Published in SPIE Proceedings Vol. 8899:
Emerging Technologies in Security and Defence; and Quantum Security II; and Unmanned Sensor Systems X
Edward M. Carapezza; Keith L. Lewis; Richard C. Hollins; Thomas J. Merlet; Mark T. Gruneisen; Miloslav Dusek; John G. Rarity, Editor(s)

© SPIE. Terms of Use
Back to Top