Name
Abstract | ||
|---|---|---|
The concept of provable cryptographic security for pseudorandom 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 the enemy can access is limited. The concept of perfect local randomness of a sequence generator is introduced and investigated using some results from coding theory. The theoretical and practical cryptographic implications of this concept are discussed. Possible extensions of the concept of local randomness as well as some applications are proposed. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF00196773 | J. Cryptology |
Keywords | Field | DocType |
Pseudorandom number generator,Provable security,Local randomness | Pseudorandom function family,Discrete mathematics,Pseudorandom generators for polynomials,Pseudorandomness,Algorithm,Theoretical computer science,Random seed,Pseudorandom generator,Random number generation,Pseudorandom generator theorem,Mathematics,Pseudorandom number generator | Journal |
Volume | Issue | Citations |
4 | 2 | 12 |
PageRank | References | Authors |
5.97 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ueli Maurer | 1 | 4526 | 505.09 |
| James L. Massey | 2 | 1096 | 272.94 |