Revisiting Prime Power RSA.
Santanu Sarkar · 2015
Recently Sarkar (DCC 2014) has proposed a new attack on small decryption exponent when RSA Modulus is of the form N = prq for r ≥ 2. This variant is known as Prime Power RSA. The work of Sarkar improves the result of May (PKC 2004) when r ≤ 5. In this paper, we improve the existing results for r = 3, 4. We also study partial key exposure attack on Prime Power RSA. Our result improves the work of May (PKC 2004) for certain parameters.