RSA and Rabin Functions: Certain Parts are as Hard as the Whole
From MaRDI portal
Publication:3787913
DOI10.1137/0217013zbMath0644.94011OpenAlexW2108104892MaRDI QIDQ3787913
Benny Chor, Oded Goldreich, Werner Alexi, Claus Peter Schnorr
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217013
securitypseudorandom number generationintractabilitypartial informationfactoringRSA encryptionprobabilistic encryption schemesRabin encryption
Related Items
Another Look at Tightness ⋮ The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone? ⋮ All Bits in ax + b mod p are Hard ⋮ Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes ⋮ More efficient DDH pseudorandom generators ⋮ Practical and provably secure release of a secret and exchange of signatures ⋮ Enhancements of trapdoor permutations ⋮ Paillier's trapdoor function hides \(\Theta(n)\) bits ⋮ Mathematical problems in cryptology ⋮ Some consequences of cryptographical conjectures for \(S_2^1\) and EF ⋮ RSA and Elliptic Curve Least Significant Bit Security ⋮ The Multivariate Hidden Number Problem ⋮ Super-Perfect Zero-Knowledge Proofs ⋮ Some consequences of cryptographical conjectures for S 2 1 and EF ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Individual simulations ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Criteria for the assessment of random number generators ⋮ On pseudorandomness in families of sequences derived from the Legendre symbol ⋮ Secure simultaneous bit extraction from Koblitz curves ⋮ Practical construction and analysis of pseudo-randomness primitives ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Bit Security of the CDH Problems over Finite Fields ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ Comparative Analysis of Random Generators ⋮ Three XOR-Lemmas — An Exposition ⋮ Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ Unnamed Item ⋮ Improved algorithms via approximations of probability distributions ⋮ Efficient, perfect polynomial random number generators
