BibTeX
@MISC{_onthe,
author = {},
title = {On the pseudo-random generator ISAAC},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. This paper presents some properties of he deterministic random bit generator ISAAC (FSE’96), contradicting several statements of its introducing article. In particular, it characterizes huge subsets of internal states which induce a strongly non-uniform distribution in the 8 192 first bits produced. A previous attack on ISAAC presented at Asiacrypt’06 by Paul and Preneel is demonstrated to be non relevant, since relies on an erroneous algorithm. Finally, a modification of the algorithm is proposed to fix the weaknesses discovered. ISAAC [2] is a deterministic random bits generator presented at FSE’96 by Jenkins, who claims that it has “no bad initial states, not even the state of all zeros”. We contradict this affirmation, presenting more than 2 8167 weak states, in Section 2, after a short description of ISAAC and the observation of some minor weaknesses, in Section 1. Recall that, as a source of non-uniform randomness, weak states might distort simulations, and harm cryptographic applications, and so generators with many such states should not be used. Sections 3 and 4 respectively propose a modification of ISAAC’s algorithm to avoid the design flaws presented, and point out an error in a previous analysis of ISAAC.
Keyphrases
pseudo-random generator isaac weak state introducing article many state short description previous analysis deterministic random bit generator erroneous algorithm design flaw huge subset non-uniform distribution minor weakness non-uniform randomness previous attack several statement non relevant deterministic random bit generator isaac isaac algorithm internal state first bit harm cryptographic application bad initial state
