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 keyunless factoring is easy.
Brown REF showed that if factoring is hard then the LE-RSA problem is intractable for SLPs with = {+, −, ·}.
Breaking RSA May Be As Difficult As Factoring
Journal of Cryptology
Journal of Cryptology
Computer Science Mathematics