ISAAC (indirection, shift, accumulate, add, and count) is a cryptographically secure pseudorandom number generator and a stream cipher designed by Robert J. Jenkins Jr. in 1993.[1] The reference implementation source code was dedicated to the public domain.[2]

"I developed (...) tests to break a generator, and I developed the generator to pass the tests. The generator is ISAAC."[3]

Operation

The ISAAC algorithm has similarities with RC4. It uses an array of 256 four-octet integers as the internal state, writing the results to another 256 four-octet integer array, from which they are read one at a time until empty, at which point they are recomputed. The computation consists of altering i-element with (i⊕128)-element, two elements of the state array found by indirection, an accumulator, and a counter, for all values of i from 0 to 255. Since it only takes about 19 32-bit operations for each 32-bit output word, it is very fast on 32-bit computers.

Cryptanalysis

Cryptanalysis has been undertaken by Marina Pudovkina (2001).[4] Her attack can recover the initial state with a complexity that is approximated to be less than the time needed for searching through the square root of all possible initial states. In practice this means that the attack needs instead of . This result has had no practical impact on the security of ISAAC.[5]

In 2006 Jean-Philippe Aumasson discovered several sets of weak states.[6] The fourth presented (and smallest) set of weak states leads to a highly biased output for the first round of ISAAC and allows the derivation of the internal state, similar to a weakness in RC4. It is not clear if an attacker can tell from just the output whether the generator is in one of these weak states or not. He also shows that a previous attack[7] is flawed, since the Paul-Preneel attack is based on an erroneous algorithm rather than the real ISAAC. An improved version of ISAAC is proposed, called ISAAC+.[5]

Usage outside cryptography

Many implementations of ISAAC are so fast that they can compete with other high speed PRNGs, even with those designed primarily for speed not for security. Only a few other generators of such high quality and speed exist in usage. ISAAC is used in the Unix tool shred to securely overwrite data.[8] Also ISAAC algorithm is implemented in Java Apache Commons Math library.[9]

References

  1. ↑ Robert J. Jenkins Jr., ISAAC. Fast Software Encryption 1996, pp. 41–49.
  2. ↑ The ISAAC Cipher
  3. ↑ Jenkins, Bob (2023-03-17). "Tests for Random Number Generators".
  4. ↑ Marina Pudovkina, A known plaintext attack on the ISAAC keystream generator, 2001, Cryptology ePrint Archive: Report 2001/049, .
  5. 1 2 "On the pseudo-random generator ISAAC" (PDF). Cryptology ePrint Archive. Retrieved 21 August 2016.
  6. ↑ Jean-Philippe Aumasson, On the pseudo-random generator ISAAC. Cryptology ePrint archive, report 2006/438, 2006.
  7. ↑ Souradyuti Paul, Bart Preneel, On the (In)security of Stream Ciphers Based on Arrays and Modular Addition.Asiacrypt 2006.
  8. ↑ GNU coreutils git
  9. ↑ "Apache Commons Math reference". Archived from the original on 2022-02-16. Retrieved 2022-02-16.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.