How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Reducing complexity assumptions for statistically-hiding commitment
- Cryptography with constant input locality
- 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
- One-message zero knowledge and non-malleable commitments
- Pseudorandom bit sequence generator for stream cipher based on elliptic curves
- Polynomial interpolation and identity testing from high powers over finite fields
- Some consequences of the existnce of pseudorandom generators
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Mathematical problems in cryptology
- One-way functions using algorithmic and classical information theories
- Practical chosen ciphertext secure encryption from factoring
- Cryptanalysis of the stream cipher LEX
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs
- Secure remote state estimation against linear man-in-the-middle attacks using watermarking
- Fourier concentration from shrinkage
- Traceable ring signatures: general framework and post-quantum security
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- On the existence of pairs of primitive normal elements over finite fields
- A brief and understandable guide to pseudo-random number generators and specific models for security
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
- A note on perfect correctness by derandomization
- A survey on delegated computation
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Algorithmic rationality: game theory with costly computation
- Simple extractors via constructions of cryptographic pseudo-random generators
- Bounds on the efficiency of black-box commitment schemes
- Realistic analysis of some randomized algorithms
- One-way permutations on elliptic curves
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
- Mining circuit lower bound proofs for meta-algorithms
- Unifying known lower bounds via geometric complexity theory
- More efficient DDH pseudorandom generators
- Reconstructive dispersers and hitting set generators
- Enhancements of trapdoor permutations
- On constructing one-way permutations from indistinguishability obfuscation
- Asymptotically efficient lattice-based digital signatures
- Universally composable symbolic security analysis
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
- 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
- Pseudorandom generators from regular one-way functions: new constructions with improved parameters
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Universal test for quantum one-way permutations
- Pseudorandom sources for BPP
- Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)
- Simple constructions from (almost) regular one-way functions
- The index calculus method using non-smooth polynomials
- On constructing one-way permutations from indistinguishability obfuscation
- Contention in cryptoland: obfuscation, leakage and UCE
- Bit Security of the CDH Problems over Finite Fields
- Fine-Grained Cryptography
- An efficient pseudo-random generator provably as secure as syndrome decoding
- A new pseudorandom generator from collision-resistant hash functions
- Plaintext-checkable encryption
- Uniform derandomization from pathetic lower bounds
- Balancing output length and query bound in hardness preserving constructions of pseudorandom functions
- The chain rule for HILL pseudoentropy, revisited
- RSA and elliptic curve least significant bit security
This page was built for publication: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339289)
