Welcome to the resource topic for 2008/260
Title:
Breaking RSA Generically is Equivalent to Factoring
Authors: Divesh Aggarwal, Ueli Maurer
Abstract: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.
ePrint: https://eprint.iacr.org/2008/260
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .