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.
CITATION STYLE
Davis, D., Ihaka, R., & Fenstermacher, P. (1994). Cryptographic randomness from air turbulence in disk drives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 839 LNCS, pp. 114–120). Springer Verlag. https://doi.org/10.1007/3-540-48658-5_13
Mendeley helps you to discover research relevant for your work.