scientific article; zbMATH DE number 176069
[For the entire collection see Zbl 0755.00002.] The author surveys problems in generating and using pseudorandom numbers. He deals with some general principles for constructing pseudorandom bit generators and its underlying group-theoretic or number-theoretic structure. Some pseudorandom bit generators are described explicitly. The author describes the subject of computational information theory and its connection to cryptography. The basic object in this theory is the concept of a secure pseudorandom bit generator. Essential properties of pseudorandom generators, especially of secure pseudorandom bit generators, are described. Results on the statistical performance of various known pseudorandom number generators are discussed with respect to suitability for cryptographic uses. It is shown that a special pseudorandom bit generator, called the RSA generator, produces secure pseudorandom bits if the problem of factoring certain integers is computationally difficult.
- Local randomness in pseudorandom sequences
- Zeta functions, one-way functions, and pseudorandom number generators.
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- More efficient DDH pseudorandom generators
- Small values of the Carmichael function and cryptographic applications
- Experimental study of the efficiency of generators of pseudo-random numbers based on the RC5 and RC6 cryptographic algorithms
- On properties of the Klimov-Shamir generator of pseudorandom numbers
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 3881757 (Why is no real title available?)
- scientific article; zbMATH DE number 4201454 (Why is no real title available?)
- Generating and testing cryptographically secure random numbers
- Time-analysis of pseudorandom bit generators
- An analytic approach to secure pseudo-random generation
- Pseudorandomness
- Pseudorandom Number Generator Using Optimal Normal Basis
- scientific article; zbMATH DE number 3928174 (Why is no real title available?)
- scientific article; zbMATH DE number 3957197 (Why is no real title available?)
- A Simple Unpredictable Pseudo-Random Number Generator
- scientific article; zbMATH DE number 4072216 (Why is no real title available?)
- Inferring sequences produced by pseudo-random number generators
- Probabilistic analysis of elementary randomizers
- Pseudorandom number generators based on random covers for finite groups
- Design of Practical and Provably Good Random Number Generators
- scientific article; zbMATH DE number 465355 (Why is no real title available?)
- `Pseudo-random' number generation within cryptographic algorithms: The DDS case
- Strong pseudorandom bit sequence generators using neural network techniques and their evaluation for secure communications
- A pseudorandom bit generator based on block upper triangular matrices
- Cryptanalytic attacks on pseudorandom number generators
- Security of Pseudo-random Generator and Monte Carlo Method
- Pseudo-random number generation on the IBM 4758 secure crypto coprocessor
- scientific article; zbMATH DE number 813732 (Why is no real title available?)
- scientific article; zbMATH DE number 861531 (Why is no real title available?)
- scientific article; zbMATH DE number 897206 (Why is no real title available?)
- scientific article; zbMATH DE number 934075 (Why is no real title available?)
- Time/memory/data tradeoffs for variants of the RSA problem
- Construction of RNG using random automata and ``one-way functions
- Using Poly-Dragon cryptosystem in a pseudorandom number generator MSTg
- Selected Areas in Cryptography
- scientific article; zbMATH DE number 4186979 (Why is no real title available?)
- Classification and realization of pseudo-random number generators
- Cryptography and Coding
- Pseudorandom generators without the XOR lemma
- Cryptography based on transcendental numbers
- KISS: a bit too simple
- Exploiting randomness on continuous sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035169)