Paper 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Contact author(s)
sarkar santanu bir @ gmail com
History
2015-08-03: received
Short URL
https://ia.cr/2015/774
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/774,
      author = {Santanu Sarkar},
      title = {Revisiting Prime Power RSA},
      howpublished = {Cryptology ePrint Archive, Paper 2015/774},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/774}},
      url = {https://eprint.iacr.org/2015/774}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.