## CryptoDB

### Paper: Breaking RSA Generically is Equivalent to Factoring

Authors: Divesh Aggarwal Ueli Maurer URL: http://eprint.iacr.org/2008/260 Search ePrint Search Google We show that a generic ring algorithm for breaking RSA in $\mathbb{Z}_N$ can be converted into an algorithm for factoring the corresponding RSA-modulus $N$. Our results imply that any attempt at breaking RSA without factoring $N$ will be non-generic and hence will have to manipulate the particular bit-representation of the input in $\mathbb{Z}_N$. This provides new evidence that breaking RSA may be equivalent to factoring the modulus.
##### BibTeX
@misc{eprint-2008-18098,
title={Breaking RSA Generically is Equivalent to Factoring},
booktitle={IACR Eprint archive},
keywords={Factoring, RSA, Generic Algorithms},
url={http://eprint.iacr.org/2008/260},
note={To appear in Eurocrypt, 2009 divesha@inf.ethz.ch 14267 received 8 Jun 2008, last revised 23 Jan 2009},
author={Divesh Aggarwal and Ueli Maurer},
year=2008
}