How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Efficient, perfect random number generators
CRYPTO '88 Proceedings on Advances in cryptology
An introduction to direct access storage devices
An introduction to direct access storage devices
Time series: data analysis and theory
Time series: data analysis and theory
Applied Cryptography: Protocols, Algorithms, and Source Code in C
Applied Cryptography: Protocols, Algorithms, and Source Code in C
A Universal Statistical Test for Random Bit Generators
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Independent Unbiased Coin Flips From A Correlated Biased Source: A Finite State Markov Chain
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
A practical secure physical random bit generator
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Cryptanalytic Attacks on Pseudorandom Number Generators
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Design and study of a strong crypto-system model for e-Commerce
ICCC '02 Proceedings of the 15th international conference on Computer communication
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
Journal of Experimental Algorithmics (JEA)
An efficient high quality random number generator for multi-programmed systems
Journal of Computer Security
Kerberos security with clocks adrift
SSYM'95 Proceedings of the 5th conference on USENIX UNIX Security Symposium - Volume 5
True random number generator based on mouse movement and chaotic hash function
Information Sciences: an International Journal
Random number generators in secure disk drives
EURASIP Journal on Embedded Systems
Mining your Ps and Qs: detection of widespread weak keys in network devices
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Local Shannon entropy measure with statistical tests for image randomness
Information Sciences: an International Journal
Entropy harvesting from physical sensors
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
| Hi-index | 0.00 |
A computer disk drive's motor speed varies slightly but irregularly, principally because of air turbulence inside the disk's enclosure. The unpredictability of turbulence is well-understood mathematically; it reduces not to computational complexity, but to information losses. By timing disk accesses, a program can efficiently extract at least 100 independent, unbiased bits per minute, at no hardware cost. This paper has three parts: a mathematical argument tracing our RNG's randomness to a formal definition of turbulence's unpredictability, a novel use of the FFT as an unbiasing algorithm, and a "sanity check" data analysis.