Editing RSA problem (section)

==Further reading==
* [http://eprint.iacr.org/2005/380 ''Breaking RSA may be as difficult as factoring''], D. Brown, 2005.  This unrefereed preprint purports that solving the RSA problem using a [[Straight line program]] is as difficult as factoring provided ''e'' has a small factor.
* [http://eprint.iacr.org/2008/260 ''Breaking RSA Generically is Equivalent to Factoring''], D. Aggarwal and U. Maurer, 2008.  This Eurocrypt 2009 paper (link is to a preprint version) proves that solving the RSA problem using a [[Generic group model|generic ring algorithm]] is as difficult as factoring.
* ''When e-th Roots Become Easier Than Factoring'', [[Antoine Joux]], David Naccache and Emmanuel Thomé, 2007.  This Asiacrypt 2007 paper (link is to a preprint version) proves that solving the RSA problem using an oracle to some certain other special cases of the RSA problem is easier than factoring.

{{Cryptography navbox | public-key}}
{{Computational hardness assumptions}}

[[Category:Computational hardness assumptions]]
[[Category:Public-key cryptography]]