Advertisement

Cryptographic Randomness from Air Turbulence in Disk Drives

  • Don Davis
  • Ross Ihaka
  • Philip Fenstermacher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 839)

Abstract

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.

Keywords

Disk Drive Weak Turbulence Sanity Check Taylor Vortex Flow Disk Controller 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    S.D. Abrahamson, C. Chiang, and J.K. Eaton, “Flow structure in head-disk assemblies and implications for design,” Adv. Info. Storage Syst., 1 (1991). pp. 111–132.Google Scholar
  2. 2.
    W. Alexi, B. Chor, O. Goldreich, and C.P. Schnorr, “RSA and Rabin functions: certain parts are as hard as the whole,” Proc. 25th IEEE Symp. on Foundations of Computer Science, 1984, pp. 449–457; see also SIAM J. on Comput., 17(2) (1988).Google Scholar
  3. 3.
    P. Bergé, Y. Pomeau, and C. Vidal, Order Within Chaos: Towards a Deterministic Approach to Turbulence, Wiley, New York, 1984.zbMATHGoogle Scholar
  4. 4.
    M. Blum, “Independent unbiased coin flips from a correlated biased source: a finite state Markov chain,” Proc. 25th Ann. Symp. on Foundations of Computer Science, 1984. pp. 425–33.Google Scholar
  5. 5.
    L. Blum, M. Blum, and M. Shub, “A simple unpredictable pseudo-random number generator,” SIAM J. Comput., 15(2) (1986). pp. 364–83.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    M. Blum and S. Micali, “How to generate cryptographically strong sequences of pseudo-random bits,” SIAM J. Comput., 13(4) (Nov. 1984). pp. 850–864.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    D. Brillinger, Time Series: Data Analysis and Theory, Holden-Day, San Francisco, 1981. Addendum.zbMATHGoogle Scholar
  8. 8.
    B. Chor and O. Goldreich, “Unbiased bits from sources of weak randomness and probabilistic communication complexity,” Proc. 26th Ann. Symp. on Foundations of Computer Science, 1985. pp. 429–42.Google Scholar
  9. 9.
    P.R. Fenstermacher, H.L. Swinney, and J.P. Gollub, “Dynamical instabilities and the transition to chaotic Taylor vortex flow,” J. Fluid Mech. 94(1) (1979). pp. 103–128.CrossRefGoogle Scholar
  10. 10.
    T. Kenjo and S. Nagamori, Permanent-Magnet and Brushless DC Motors, Monographs in Electrical and Electronic Engineering No. 18, Clarendon Press, Oxford, UK, 1985.Google Scholar
  11. 11.
    T.G. Lewis, Distribution Sampling for Computer Simulation, Lexington Books, Lexington, Mass., 1975. p.3.zbMATHGoogle Scholar
  12. 12.
    U. Maurer, “A universal statistical test for random bit generators,” Crypto’ 90 Conference Proceedings, Springer-Verlag Lecture Notes in Computer Science 537, New York, 1991. pp. 408–420.Google Scholar
  13. 13.
    S. Micali, and C.P. Schnorr, “Efficient, perfect random number generators,” Crypto’ 88 Conference Proceedings, Springer-Verlag Lecture Notes in Computer Science 403, New York, 1990. pp. 173–198.Google Scholar
  14. 14.
    S. Newhouse, D. Ruelle, and F. Takens, “Occurence of strange Axiom A attractors near quasi-periodic flows of T m m ≥ 3,” Commun. Math. Phys. 64 (1978), pp. 35–40.zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    D. Ruelle, Elements of Differentiable Dynamics and Bifurcation Theory, Academic Press, San Diego, 1989.zbMATHGoogle Scholar
  16. 16.
    M. Santha and U.V. Vazirani, “Generating quasi-random sequences from semi-random sources,” J. Comput. System Sci., 33 (1986). pp. 75–87.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C; Wiley, New York, 1994. p. 370.Google Scholar
  18. 18.
    H. Sierra, An Introduction to Direct-Access Storage Devices, Academic Press, Boston, Mass., 1990. pp. 100–106.zbMATHGoogle Scholar
  19. 19.
    Brian Tanner, personal communication.Google Scholar
  20. 20.
    R. Temam, Infinite-dimensional dynamical systems in mechanics and physics, Springer-Verlag Applied Mathematical Sciences 68, 1988, pp. 389–92.Google Scholar
  21. 21.
    D.F. Torok and R. Gronseth, “Flow and thermal fields in channels between corotating disks,” IEEE Trans. on Components, Hybrids, and Manuf. Tech., 11(4) (Dec. 1988). pp. 585–593.CrossRefGoogle Scholar
  22. 22.
    U. Vazirani, “Towards a strong communication complexity theory, or generating quasi-random sequences from two communicating slightly-random sources,” (extended abstract, undated).Google Scholar
  23. 23.
    J. von Neumann, “Various techniques used in connection with random digits,” Notes by G.E. Forsythe, National Bureau of Standards, Applied Math Series, Vol. 12, pp. 36–38, Reprinted in von Neumann’s Collected Works, Vol. 5, Pergamon Press (1963). pp. 768–770.Google Scholar
  24. 24.
    A.C. Yao, “Theory and applications of trapdoor functions,” Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982. pp. 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Don Davis
    • 1
  • Ross Ihaka
    • 2
  • Philip Fenstermacher
    • 3
  1. 1.Openvision TechnologiesCambridge
  2. 2.Mathematics DeptUniversity of AucklandAuckland
  3. 3.Cambridge

Personalised recommendations