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.
Chapter PDF
Similar content being viewed by others
Keywords
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
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput, 13:850–864, 1984.
W. G. Chambers, private communication. udee205@bay.cc.kcl.ac.uk.
D. Knuth. Seminumerical Methods, volume 2, chapter 3. Addison Wesley, 1981.
D. Knuth. Seminumerical Methods, volume 3, chapter 5. Addison Wesley, 1981.
V. F. Kolchin. Random mappings. Optimization Software Inc., 1986.
S. Lloyd. Counting binary functions with certain cryptographic properties. Journal of Cryptology, 5:107–131, 1992.
G. Marsaglia. A new class of random number generators. The Annals of Applied Probability, 1:462–480, 1991.
G. Marsaglia. Diehard. ftp stat.fsu.edu/pub/diehard/diehard.zip, 1995.
A. M. Odlyzko P. Flajolet. Random mapping statistics. Lecture Notes in Computer Science, 434:329–354, 1990.
W. Poundstone. Labyrinths of Reason. Anchor Press, 1988.
An0nYm0Us UsEr. Rc4 ? sci.crypt, 1994.
A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jenkins, R.J. (1996). ISAAC. In: Gollmann, D. (eds) Fast Software Encryption. FSE 1996. Lecture Notes in Computer Science, vol 1039. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60865-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-60865-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60865-3
Online ISBN: 978-3-540-49652-6
eBook Packages: Springer Book Archive