How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
From MaRDI portal
Publication:3339289
DOI10.1137/0213053zbMath0547.68046WikidataQ55918694 ScholiaQ55918694MaRDI QIDQ3339289
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213053
cryptography; randomness; unpredictability; pseudo-random number generation; pseudo-random bit generator; random self-reducibility
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
65C10: Random number generation in numerical analysis
Related Items
Gauss periods: orders and cryptographical applications, Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key Cipher, Asymptotically Efficient Lattice-Based Digital Signatures, NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMES, Natural proofs, Pseudorandom generators without the XOR lemma, Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Pseudo-random generators for all hardnesses, Computational sample complexity and attribute-efficient learning, Bounds on tradeoffs between randomness and communication complexity, A short proof for explicit formulas for discrete logarithms in finite fields, Constant-round perfect zero-knowledge computationally convincing protocols, Bit commitment using pseudorandomness, Pseudorandom bits for constant depth circuits, Efficient, perfect polynomial random number generators, Performance improvement for the GGM-construction of pseudorandom functions, A note on computational indistinguishability, A discrete logarithm implementation of perfect zero-knowledge blobs, Probabilistic encryption, Generating quasi-random sequences from semi-random sources, Reductions among number theoretic problems, On the notion of infinite pseudorandom sequences, On using deterministic functions to reduce randomness in probabilistic algorithms, On solving hard problems by polynomial-size circuits, One-way functions and circuit complexity, One way functions and pseudorandom generators, Expanders, randomness, or time versus space, One-way permutations in NC 0, An unpredictability approach to finite-state randomness, On the power of two-point based sampling, A study of password security, Random languages for nonuniform complexity classes, Local randomness in pseudorandom sequences, An introduction to randomized algorithms, Almost everywhere high nonuniform complexity, Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs, Pseudorandom generators for space-bounded computation, A uniform-complexity treatment of encryption and zero-knowledge, A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm, Synthesizers and their application to the parallel construction of pseudo-random functions, Universal tests for nonuniform distributions, The discrete logarithm modulo a composite hides \(O(n)\) bits, Self-testing/correcting with applications to numerical problems, \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs, Randomness in interactive proofs, Provably good pattern generators for a random pattern test, The vulnerability of geometric sequences based on fields of odd characteristic, The power of adaptiveness and additional queries in random-self- reductions, Hardness vs randomness, On the hardness of computing the permanent of random matrices, Zeta functions, one-way functions, and pseudorandom number generators., Optimal bounds for the approximation of Boolean functions and some applications, A random number generator based on elliptic curve operations, Resource bounded randomness and computational complexity, Protecting data privacy in private information retrieval schemes, Improved algorithms via approximations of probability distributions, Randomness vs time: Derandomization under a uniform assumption, A comparison of two approaches to pseudorandomness, Some consequences of the existnce of pseudorandom generators, Fast generation of prime numbers and secure public-key cryptographic parameters., Mathematical problems in cryptology, Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs, Realistic analysis of some randomized algorithms, One-way permutations on elliptic curves, On pseudorandomness in families of sequences derived from the Legendre symbol, The reactive simulatability (RSIM) framework for asynchronous systems, Practical construction and analysis of pseudo-randomness primitives, Logics for reasoning about cryptographic constructions, Universal test for quantum one-way permutations, Pseudorandom sources for BPP, The index calculus method using non-smooth polynomials, QUAD: A Practical Stream Cipher with Provable Security, Sparse pseudorandom distributions, The Monte Carlo Algorithm with a Pseudorandom Generator
