Skip to main content
Conference ProceedingsOPEN ACCESS

ISAAC

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1039 41-49
DOI: 10.1007/3-540-60865-6_41
41Citations
Citations of this article
90Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Jenkins, R. J. (1996). ISAAC. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1039, pp. 41–49). Springer Verlag. https://doi.org/10.1007/3-540-60865-6_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free