An Efficient Generation Method for Uniformly Distributed Random Numbers
Problems of Information Transmission
New Methods for Digital Generation and Postprocessing of Random Data
IEEE Transactions on Computers
The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
High-Speed True Random Number Generation with Logic Gates Only
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
More efficient DDH pseudorandom generators
Designs, Codes and Cryptography
Efficient pseudorandom generators based on the DDH assumption
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Extractors for Jacobian of hyperelliptic curves of genus 2 in odd characteristic
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
On the security of pseudorandomized information-theoretically secure schemes
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
On the use of financial data as a random beacon
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Unbiased random sequences from quasigroup string transformations
FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
Fast and reliable random number generators for scientific computing
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Hard bits of the discrete log with applications to password authentication
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Bad and good ways of post-processing biased physical random numbers
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Pseudorandom generators based on subcovers for finite groups
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Universal gates in other universes
RC'13 Proceedings of the 5th international conference on Reversible Computation
| Hi-index | 754.84 |
We present a new technique for simulating fair coin flips using a biased, stationary source of randomness. Sequences of random numbers are of pervasive importance in cryptography and vital to many other computing applications. Many sources of randomness, such as radioactive or quantum-mechanical sources, possess the property of stationarity. In other words, they produce independent outputs over fixed probability distributions. The output of such sources may be viewed as the result of rolling a biased or loaded die. While a biased die may be a good source of entropy, many applications require input in the form of unbiased bits, rather than biased ones. For this reason, von Neumann (1951) presented a now well-known and extensively investigated technique for using a biased coin to simulate a fair coin. We describe a new generalization of von Neumann's algorithm distinguished by its high level of practicality and amenability to analysis. In contrast to previous efforts, we are able to prove our algorithm optimally efficient, in the sense that it simulates the maximum possible number of fair coin flips for a given number of die rolls. In fact, we are able to prove that in an asymptotic sense our algorithm extracts the full entropy of its input. Moreover, we demonstrate experimentally that our algorithm achieves a high level of computational and output efficiency in a practical setting