Welcome to the resource topic for 2005/380
Title:
Breaking RSA May Be As Difficult As Factoring
Authors: 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.
ePrint: https://eprint.iacr.org/2005/380
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 .