On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
From MaRDI portal
Publication:5459079
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; zbMATH DE number 4201454
- 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
(23)- Comparative Analysis of Random Generators
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Efficient amplification of the security of weak pseudo-random function generators
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
- On the power generator and its multivariate analogue
- On the Security of Pseudorandomized Information-Theoretically Secure Schemes
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Making RSA–PSS Provably Secure against Non-random Faults
- Time/memory/data tradeoffs for variants of the RSA problem
- Public Key Perturbation of Randomized RSA Implementations
- QUAD: A multivariate stream cipher with provable security
- Using LLL-reduction for solving RSA and factorization problems
- scientific article; zbMATH DE number 177048 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 16481 (Why is no real title available?)
- More efficient DDH pseudorandom generators
- scientific article; zbMATH DE number 1740041 (Why is no real title available?)
- 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
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)
