Stronger security proofs for RSA and Rabin bits.

DOI10.1007/S001459910008MaRDI QIDQ1976263zbMATH OpenOpenAlexWikidataFDO

Authors Roger Fischlin, Claus Peter Schnorr

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

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

Recommendations

• Proofs of security for improved Rabin signature scheme
• An improved binary algorithm for RSA
• Proving Tight Security for Rabin-Williams Signatures
• Some RSA-based encryption schemes with tight security reduction
• Improved results on cryptanalysis of prime power RSA
• scientific article; zbMATH DE number 1583791
• Recent advances in RSA cryptography
• Strengthening Security of RSA-OAEP

Cited in

(26)

• Synthesizers and their application to the parallel construction of pseudo-random functions
• Practical chosen ciphertext secure encryption from factoring
• An improved binary algorithm for RSA
• More efficient DDH pseudorandom generators
• 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
• Secure ElGamal-type cryptosystems without message encoding
• RSA and elliptic curve least significant bit security
• Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
• Comparative Analysis of Random Generators
• Practical Chosen Ciphertext Secure Encryption from Factoring
• RSA-bits are 0.5 + ε secure
• scientific article; zbMATH DE number 3977016 (Why is no real title available?)
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• On the power generator and its multivariate analogue
• Non-interactive key exchange
• RSA bits are .732 + secure
• Simple verifiable delay functions
• Using LLL-reduction for solving RSA and factorization problems
• Adaptive partitioning
• The security of all RSA and discrete log bits
• Certifying giant nonprimes
• PPAD is as hard as LWE and iterated squaring
• On the possibility of a backdoor in the Micali-Schnorr generator
• Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976263)