As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see Math::Random::MT), this algorithm is designed to take some seed information and produce seemingly random results as output. However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has different goals than these commonly used algorithms. In particular, it's really fast - on average, it requires only 18.75 machine cycles to generate a 32-bit value. This makes it suitable for applications where a significant amount of random data needs to be produced quickly, such solving using the Monte Carlo method or for games. The results are uniformly distributed, unbiased, and unpredictable unless you know the seed. The algorithm was published by Bob Jenkins in the late 90s and despite the best efforts of many security researchers, no feasible attacks have been found to date.
| Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
|---|---|---|---|---|---|
| 1.004-bp155.2.9 info | GA Release | 2023-05-17 | 15 SP5 |
|
|
| 1.004-bp154.1.19 info | GA Release | 2022-05-09 | 15 SP4 |
|
|
| 1.004-bp153.1.14 info | GA Release | 2021-03-06 | 15 SP3 |
|
|
| 1.004-bp152.3.13 info | GA Release | 2020-04-16 | 15 SP2 |
|
|
| 1.004-bp151.3.1 info | GA Release | 2019-07-17 | 15 SP1 |
|
|
| 1.004-bp151.2.12 info | GA Release | 2019-05-18 | 15 SP1 |
|
|
| 1.004-bp150.2.3 info | GA Release | 2018-07-30 | 15 |
|
|