Name
Abstract | ||
|---|---|---|
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 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 |
|---|---|---|
1989 | 10.1007/0-387-34805-0_11 | CRYPTO |
Keywords | Field | DocType |
local randomness,provable cryptographic security,possible extension,perfect local randomness,sequence generator,pseudo-random sequences,certain problem,practical cryptographic implication,infinite computational resource,pseudo-random sequence,pseudo-random number generator,coding theory,pseudo random number generator,random sequence | Discrete mathematics,Block cipher,Cryptography,Computer science,Algorithm,Theoretical computer science,Stream cipher,Coding theory,Randomness tests,Pseudorandom number generator,Randomness,Dual code | Conference |
Volume | ISSN | ISBN |
435 | 0302-9743 | 0-387-97317-6 |
Citations | PageRank | References |
14 | 3.68 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ueli Maurer | 1 | 4526 | 505.09 |
| James L. Massey | 2 | 1096 | 272.94 |