On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
From MaRDI portal
Publication:5459079
DOI10.1007/11935230_13zbMATH Open1172.94597OpenAlexW2171042141WikidataQ59485062 ScholiaQ59485062MaRDI QIDQ5459079FDOQ5459079
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
Publication date: 24 April 2008
Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11935230_13
Recommendations
- The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators
- An efficient pseudo-random generator provably as secure as syndrome decoding
- Making RSA–PSS Provably Secure against Non-random Faults
- scientific article
- scientific article; zbMATH DE number 2085420
- On the security of modular exponentiation with application to the construction of pseudorandom generators
- Pseudorandom functions and permutations provably secure against related-key attacks
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- An analytic approach to secure pseudo-random generation
Cited In (22)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
- Efficient amplification of the security of weak pseudo-random function generators
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials
- On the power generator and its multivariate analogue
- Using LLL-Reduction for Solving RSA and Factorization Problems
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- Making RSA–PSS Provably Secure against Non-random Faults
- Public Key Perturbation of Randomized RSA Implementations
- QUAD: A multivariate stream cipher with provable security
- Title not available (Why is that?)
- On the possibility of a backdoor in the Micali-Schnorr generator
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
- Predicting masked linear pseudorandom number generators over finite fields
- Title not available (Why is that?)
- More efficient DDH pseudorandom generators
- Title not available (Why is that?)
- A fast pseudorandom number generator with BLAKE hash function
- A new framework for deniable secure key exchange
- On the concrete security of Goldreich's pseudorandom generator
- Commitments with efficient zero-knowledge arguments from subset sum problems
- Comparative Analysis of Random Generators
This page was built for publication: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459079)
