Welcome to the resource topic for 2014/035
Title:
A new attack on RSA with a composed decryption exponent
Authors: Abderrahmane Nitaj, Mohamed Ould Douh
Abstract:In this paper, we consider an RSA modulus N=pq, where the prime factors p, q are of the same size. We present an attack on RSA when the decryption exponent d is in the form d=Md_1+d_0 where M is a given positive integer and d_1 and d_0 are two suitably small unknown integers. In 1999, Boneh and Durfee presented an attack on RSA when d<N^{0.292}. When d=Md_1+d_0, our attack enables one to overcome Boneh and Durfee’s bound and to factor the RSA modulus.
ePrint: https://eprint.iacr.org/2014/035
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 .