Breaking RSA May Be As Difficult As Factoring

Daniel R.  L.  Brown

Paper 2005/380 Original: eprint.iacr.org/2005/380 ↗

Breaking RSA May Be As Difficult As Factoring

Daniel R. L. Brown

Abstract

If factoring is hard, this paper shows that straight line programs cannot efficiently solve the low public exponent RSA problem. More precisely, no efficient algorithm can take an RSA public key as input and then output a straight line program that efficiently solves the low public exponent RSA problem for the given public key --- unless factoring is easy.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2008-01-07: last updated; 2005-10-23: published
Short URL: https://ia.cr/2005/380
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/380,
      author = {Daniel R.  L.  Brown},
      title = {Breaking RSA May Be As Difficult As Factoring},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/380},
      year = {2005},
      url = {https://eprint.iacr.org/2005/380}
}