ISAAC

41Citations
Citations of this article
90Readers
Mendeley users who have this article in their library.

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.

References Powered by Scopus

HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS.

846Citations
N/AReaders
Get full text

Random mapping statistics

211Citations
N/AReaders
Get full text

Counting binary functions with certain cryptographic properties

13Citations
N/AReaders
Get full text

Cited by Powered by Scopus

TestU01: A C library for empirical testing of random number generators

802Citations
N/AReaders
Get full text

Particle swarm optimization with mutation

253Citations
N/AReaders
Get full text

Theoretical Design and FPGA-Based Implementation of Higher-Dimensional Digital Chaotic Systems

227Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 44

72%

Professor / Associate Prof. 7

11%

Lecturer / Post doc 5

8%

Researcher 5

8%

Readers' Discipline

Tooltip

Computer Science 27

57%

Medicine and Dentistry 8

17%

Engineering 7

15%

Social Sciences 5

11%

Article Metrics

Tooltip
Mentions
References: 1

Save time finding and organizing research with Mendeley

Sign up for free