Pages that link to "Item:Q1976263"
From MaRDI portal
The following pages link to Stronger security proofs for RSA and Rabin bits. (Q1976263):
Displaying 18 items.
- On the power generator and its multivariate analogue (Q413475) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- An improved binary algorithm for RSA (Q2365963) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- On the distribution of the power generator (Q2723530) (← links)
- Period of the power generator and small values of Carmichael's function (Q2723531) (← links)
- Secure ElGamal-Type Cryptosystems Without Message Encoding (Q2803659) (← links)
- RSA and Elliptic Curve Least Significant Bit Security (Q2946472) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Comparative Analysis of Random Generators (Q3387110) (← links)
- Practical Chosen Ciphertext Secure Encryption from Factoring (Q3627442) (← links)
- Non-Interactive Key Exchange (Q4916014) (← links)
- Simple verifiable delay functions (Q5090439) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Adaptive Partitioning (Q5270372) (← links)
- On the possibility of a backdoor in the Micali-Schnorr generator (Q6635756) (← links)
