Stronger security proofs for RSA and Rabin bits.

DOI10.1007/s001459910008zbMath1060.94018OpenAlexW2018738738WikidataQ127213132 ScholiaQ127213132MaRDI QIDQ1976263

Claus Peter Schnorr, Roger Fischlin

Publication date: 2000

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459910008

zbMATH Keywords

perfect pseudorandom number generatorRabin functionRSA functionRSA random number generator

Mathematics Subject Classification ID

Cryptography (94A60) Sampling theory in information and communication theory (94A20)

Related Items (18)

More efficient DDH pseudorandom generators ⋮ RSA and Elliptic Curve Least Significant Bit Security ⋮ Certifying giant nonprimes ⋮ Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials ⋮ On the power generator and its multivariate analogue ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ On the distribution of the power generator ⋮ Period of the power generator and small values of Carmichael’s function ⋮ Non-Interactive Key Exchange ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Secure ElGamal-Type Cryptosystems Without Message Encoding ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ Comparative Analysis of Random Generators ⋮ Simple verifiable delay functions ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions ⋮ Adaptive Partitioning

This page was built for publication: Stronger security proofs for RSA and Rabin bits.