Pages that link to "Item:Q3787913"
From MaRDI portal
The following pages link to RSA and Rabin Functions: Certain Parts are as Hard as the Whole (Q3787913):
Displayed 33 items.
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- Efficient, perfect polynomial random number generators (Q809536) (← links)
- Criteria for the assessment of random number generators (Q916295) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Enhancements of trapdoor permutations (Q2392094) (← links)
- On pseudorandomness in families of sequences derived from the Legendre symbol (Q2460689) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Individual simulations (Q2691606) (← links)
- Bit Security of the CDH Problems over Finite Fields (Q2807226) (← links)
- Another Look at Tightness (Q2889878) (← links)
- RSA and Elliptic Curve Least Significant Bit Security (Q2946472) (← links)
- The Multivariate Hidden Number Problem (Q2947535) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Three XOR-Lemmas — An Exposition (Q3088188) (← links)
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art (Q3088194) (← links)
- Comparative Analysis of Random Generators (Q3387110) (← links)
- The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone? (Q3452343) (← links)
- All Bits in ax + b mod p are Hard (Q3452346) (← links)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347) (← links)
- Practical Chosen Ciphertext Secure Encryption from Factoring (Q3627442) (← links)
- (Q4615809) (← links)
- Super-Perfect Zero-Knowledge Proofs (Q5098773) (← links)
- Some consequences of cryptographical conjectures for S 2 1 and EF (Q6064283) (← links)
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications (Q6091132) (← links)
- Paradigms for Unconditional Pseudorandom Generators (Q6149335) (← links)