D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (7 citations) (Correct)
....and lattice reduction In the general case, the best attack against RSA encryption or signature is integer factorization. Note that to prove (or disprove) the equivalence between integer factorization and breaking RSA encryption remains an important open problem in cryptology (latest results [25] suggest that breaking RSA encryption may actually be easier) We already pointed out that in some special cases, lattice reduction leads to efficient factorization: when the factors are partially known [38] or when the number to factor has the form p q with large r [21] Schnorr [123] was ....
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In Proc. of Eurocrypt '98, volume 1233 of LNCS, pages 59--71. Springer-Verlag, 1998.
The Effectiveness of Lattice Attacks Against Low-Exponent RSA - Coupé, Nguyen, Stern (1999) (Correct)
.... 1 Introduction One longstanding open problem in cryptography is to find an efficient attack against the RSA public key cryptosystem [13] In the general case, the bestknown method is factoring, although the equivalence of factorization and breaking RSA is still open (note that recent results [3] suggest that breaking RSA might be easier than factoring) However, under certain conditions, more efficient attacks are known (for a survey, see [2] One of these conditions is when the public exponent is small, e.g. 3. This is the so called low exponent RSA, which is quite popular in the real ....
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In Proc. of Eurocrypt '98, volume 1233 of LNCS, pages 59--71. Springer-Verlag, 1998.
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
....and lattice reduction In the general case, the best attack against RSA encryption or signature is integer factorization. Note that to prove (or disprove) the equivalence between integer factorization and breaking RSA encryption remains an important open problem in cryptology (latest results [19] suggest that breaking RSA encryption may actually be easier) We already pointed out that in some special cases, lattice reduction leads to efficient factorization: when the factors are partially known [32] or when the number to factor has the form p q with large r [17] Schnorr [103] was ....
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In Proc. of Eurocrypt '98, volume 1233 of LNCS. IACR, Springer-Verlag, 1998.
On the Security of a Williams Based Public Key Encryption Scheme - Müller (2000) (1 citation) (Correct)
....primitives it employs. While RSA [29] is undoubtedly the most well known and widely used public key cryptosystem, it is not known if breaking RSA is as dicult as factoring. The question of whether knowledge of the factors of the modulus n is required in order to invert RSA, remains open (cf. [7, 8]) because we know of attacks that do not rely on the factorization intractability. It is therefore of interest to develop cryptographic schemes whose security is equivalent in the diculty to factoring the modulus, i.e. for which it is necessary to factor n in order to retrieve plaintext from ....
D. Boneh, R. Venkatesan, Breaking RSA May Not Be Equivalent to Factoring, Advances of Cryptology - Eurocrypt '98, LNCS 1403, K. Nyberg (ed.), Springer-Verlag (1998) pp. 59-71.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2001) (16 citations) (Correct)
....less than 4 bits of security. To obtain 0 , we can take k0 = log 2 qsig 8 and k1 = kmin 8, which gives 0 = 1:04 . 9 Instead, in order to show that there is no better reduction from inverting RSA to breaking FDH, we will use a similar approach as Boneh and Venkatesan in [3] for disproving the equivalence between inverting low exponent RSA and factoring. They show that any ecient algebraic reduction from factoring to inverting low exponent RSA can be converted into an ecient factoring algorithm. Such reduction is an algorithm A which factors N using an e th root ....
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt ' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71.
Security Proofs for the RSA-PSS Signature Scheme and Its Variants - Jonsson (2000) (Correct)
....from choosing a public exponent larger than 2. There is a similar conclusion for RSAGenPSS. However, the underlying RSA problem is di erent for di erent public exponents and it is not known whether those problems are computationally equivalent and how they relate to the factoring problem; see [5, 6] for discussion. The RW GenPSS R signature scheme with message recovery is de ned in the obvious way. One easily checks that the security bounds in Theorem 12.1 hold for this scheme as well. 13 Concluding discussion It is important to note that the security discussions in this paper take ....
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In Advances in Cryptology - Eurocrypt '98, pp. 59-71. Springer Verlag, 1998.
Cryptanalysis of RSA Using Algebraic and Lattice Methods - Durfee (2002) Self-citation (Boneh) (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In proceedings Eurocrypt '98, Lecture Notes in Computer Science, vol. 1403, Springer-Verlag, pp. 59--71, 1998.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59--71.
A New Rabin-type Trapdoor Permutation Equivalent to Factoring.. - Schmidt-Samoa (2005) (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In Nyberg [Nyb98], pages 59-71.
The One-More-RSA-Inversion Problems and the.. - Bellare.. (2001) (10 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In K. Nyberg, editor, Advances in Cryptology { EUROCRYPT ' 98, volume 1233 of Lecture Notes in Computer Science, pages 59-71. Springer-Verlag, Berlin Germany, 1998.
The Static Diffie-Hellman Problem - Brown, Gallant (2004) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Advances in Cryptology | EUROCRYPT '98, LNCS, vol. 1233, Springer, 1998, pp. 59-71.
Another Look at "Provable Security" - Koblitz, Menezes (2004) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Advances in Cryptology { Eurocrypt '98, LNCS 1233, SpringerVerlag, 1998, pp. 59-71.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2001) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt ' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71.
Another Look at "Provable Security" - Koblitz, Menezes (2004) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Advances in Cryptology -- Eurocrypt '98, LNCS 1233, SpringerVerlag, 1998, pp. 59-71.
A Survey of Public-Key Cryptosystems - Koblitz, Menezes (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring, Advances in Cryptology --- EUROCRYPT '98, Lecture Notes in Computer Science, 1403 (1998), Springer-Verlag, pp. 59-71.
RSA Problem - Rivest (2003) (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In K. Nyberg, editor, Proc. EUROCRYPT '98, pages 59--71. Springer, 1998.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59-71.
Computing Zeta Functions Of Curves Over Finite Fields - Vercauteren (2003) (1 citation) (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring (extended abstract). In K. Nyberg, editor, Advances in Cryptology, Proceedings Eurocrypt 1998.
Optimal Security Proofs for PSS and other Signature Schemes - Coron (2002) (16 citations) (Correct)
No context found.
D. Boneh and R. Venkatesan, Breaking RSA may not be equivalent to factoring. Proceedings of Eurocrypt' 98, LNCS vol. 1403, Springer-Verlag, 1998, pp. 59--71.
Why Provable Security Matters? - Stern (Correct)
No context found.
D. Boneh and R. Venkatesan. Breaking RSA may not be equivalent to factoring. In 1998, 59-71,.
Forward-Secure Blind Signature Scheme Based on the Strong RSA .. - Duc, Cheon, Kim (2003) (1 citation) (Correct)
No context found.
Dan Boneh and Ramarathnam Venkatesan, "Breaking RSA May Not Be Equivalent to Factoring", Advances in Cryptology - EUROCRYPT'98, LNCS 1403, SpringerVerlag, pp. 59-71, 1998.
Teams as Types: Authorization in Groupware Revisited - Brügge, al. (Correct)
No context found.
Boneh, D., and Venkatesan R. Breaking RSA may not be equivalent to factoring. In Proceedings Eurocrypt '98, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1998, 59-71.
Practical cryptography - the key size problem: PGP after years - Fibíková, Vyskoc (2001) (Correct)
No context found.
Dan Boneh and Ramarathnam Venkatesan. Breaking RSA may not be equivalent to factoring. In Advances in Cryptology - Crypto '98, pages 59--71, Berlin, 1998. Springer-Verlag. Lecture Notes in Computer Science Volume 963.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC