Advertisement

ISAAC

  • Robert J. JenkinsJr.
Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1039)

Abstract

A sequence of new pseudorandom number generators are developed: IA, IBAA, and ISAAC. No efficient method is known for deducing their internal states. ISAAC requires an amortized 18.75 instructions to produce a 32-bit value. There are no cycles in ISAAC shorter than 240 values. The expected cycle length is 28295 values. Tests show that scaled-down versions of IBAA are unbiased for their entire cycle length. No proofs of security are given.

Keywords

Internal State Cycle Length Random Number Generator Short Cycle Gaussian Elimination 
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.
    M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput, 13:850–864, 1984.Google Scholar
  2. 2.
    W. G. Chambers, private communication. udee205@bay.cc.kcl.ac.uk.Google Scholar
  3. 3.
    D. Knuth. Seminumerical Methods, volume 2, chapter 3. Addison Wesley, 1981.Google Scholar
  4. 4.
    D. Knuth. Seminumerical Methods, volume 3, chapter 5. Addison Wesley, 1981.Google Scholar
  5. 5.
    V. F. Kolchin. Random mappings. Optimization Software Inc., 1986.Google Scholar
  6. 6.
    S. Lloyd. Counting binary functions with certain cryptographic properties. Journal of Cryptology, 5:107–131, 1992.Google Scholar
  7. 7.
    G. Marsaglia. A new class of random number generators. The Annals of Applied Probability, 1:462–480, 1991.Google Scholar
  8. 8.
    G. Marsaglia. Diehard. ftp stat.fsu.edu/pub/diehard/diehard.zip, 1995.Google Scholar
  9. 9.
    A. M. Odlyzko P. Flajolet. Random mapping statistics. Lecture Notes in Computer Science, 434:329–354, 1990.Google Scholar
  10. 10.
    W. Poundstone. Labyrinths of Reason. Anchor Press, 1988.Google Scholar
  11. 11.
    An0nYm0Us UsEr. Rc4 ? sci.crypt, 1994.Google Scholar
  12. 12.
    A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Robert J. JenkinsJr.

There are no affiliations available

Personalised recommendations