Cryptology ePrint Archive: Report 2015/774

Revisiting Prime Power RSA

Santanu Sarkar

Abstract: Recently Sarkar (DCC 2014) has proposed a new attack on small decryption exponent when RSA Modulus is of the form N=p^rq 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.

Category / Keywords: public-key cryptography /

Date: received 3 Aug 2015

Contact author: sarkar santanu bir at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150803:191902 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]