How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
An updated table of minimum-distance bounds for binary linear codes
IEEE Transactions on Information Theory
On the construction of a random number generator and random function generators
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
On the power of two-point based sampling
Journal of Complexity
Primality and Cryptography
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to construct pseudorandom permutations from single pseudorandom functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
A provably-secure strongly-randomized cipher
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Improved security bounds for pseudorandom permutations
Proceedings of the 4th ACM conference on Computer and communications security
Spreading Codes Generator for Wireless CDMA Networks
Wireless Personal Communications: An International Journal
A Markov chain sequence generator for power macromodeling
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Ideals over a non-commutative ring and their application in cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
| Hi-index | 0.00 |
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.