On the construction of a random number generator and random function generators

Authors:
C. P. Schnorr
Affiliations:
Univ. Frankfurt, Frankfurt, W. Germany
Venue:
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Year:
1988

Citing 6
Cited 12

How to generate cryptographically strong sequences of pseudo-random bits

SIAM Journal on Computing
How to construct random functions

Journal of the ACM (JACM)
Pseudo-random permutation generators and cryptographic composition

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple unpredictable pseudo random number generator

SIAM Journal on Computing
RSA and Rabin functions: certain parts are as hard as the whole

SIAM Journal on Computing - Special issue on cryptography
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd 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
Perfect local randomness in pseudo-random sequences

CRYPTO '89 Proceedings on Advances in cryptology
On the construction of block ciphers provably secure and not relying on any unproved hypotheses (extended abstract)

CRYPTO '89 Proceedings on Advances in cryptology
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved security bounds for pseudorandom permutations

Proceedings of the 4th ACM conference on Computer and communications security
Strong Pseudorandom Bit Sequence Generators Using Neural Network Techniques and Their Evaluation for Secure Communications

AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Cryptanalysis of the Hwang-Rao Secret Error-Correcting Code Schemes

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Almost k-wise independent sample spaces and their cryptologic applications

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Probabilistic analysis of elementary randomizers

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Local randomness in candidate one-way functions

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
On the universal hash functions in Luby-Rackoff cipher

ICISC'02 Proceedings of the 5th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Blum, Micali (1982), Yao (1982). Goldreich, Goldwassar and Micali (1984). and Luby, Rackoff (1986) have constructed random number generators, random function generators and random permutation generators that are perfect if certain complexity assumptions hold. We propose random number generators that pass all statistical tests that depend on a small fraction of the bitstring. This does not rely on any unproven hypothesis. We propose improved random function generators with short function names and which minimize the number of pseudo-random bits that are necessary for the evaluation of pseudo-random functions. We announce a new very efficient perfect random number generator.