| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 417886 | Discrete Applied Mathematics | 2016 | 7 Pages |
Abstract
Recently Sarkar (DCC 2014) has proposed a new attack on small decryption exponent when RSA Modulus is of the form N=prqN=prq for r≥2r≥2. This variant is known as Prime Power RSA. The work of Sarkar improves the result of May (PKC 2004) when r≤5r≤5. In this paper, we improve the work of Sarkar when 2
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Santanu Sarkar,