Skip to main content
Conference ProceedingsOPEN ACCESS

Breaking RSA generically Is equivalent to factoring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5479 LNCS 36-53
DOI: 10.1007/978-3-642-01001-9_2
36Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that a generic ring algorithm for breaking RSA in ℤ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 ℤN. This provides new eviDence that breaking RSA may be equivalent to factoring the modulus. © International Association for Cryptologic Research 2009.

Cite

CITATION STYLE

APA

Aggarwal, D., & Maurer, U. (2009). Breaking RSA generically Is equivalent to factoring. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5479 LNCS, pp. 36–53). https://doi.org/10.1007/978-3-642-01001-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free