Perfect Local Randomness in Pseudo-Random Sequences
Ueli Maurer and James L. Massey
The concept of provable cryptographic security for pseudo-random number generators that was introduced by Schnorr is investigated and extended. The cryptanalyst is assumed to have infinite computational resources and hence the security of the generators does not rely on any unproved hypothesis about the difficulty of solving a certain problem, but rather relies on the assumption that the number of bits of the generated sequence generator is introduced and investigated using some results from coding theory. The theoretical and practical results of this concept are discussed. Possible extensions of the concept of local randomness as well as some applications are proposed.