Name
Abstract | ||
|---|---|---|
There are many partial key exposure attacks on RSA or its variants under the assumption that a portion of the bits of the decryption exponent d is exposed. Sarkar and Maitra presented a further attack when some bits of the private prime factor q in the modulus N = pq are simultaneously revealed and the total number of bits of q and d required to be known is reduced compared to previous partial key exposure attacks. In this paper, for both the standard RSA with moduli N = pq and the Takagi's variant of RSA with moduli N = p(2)q, we propose partial key exposure attacks when most significant bits (MSBs) or least significant bits of q are exposed. Compared with previous results, our theoretical analysis and experimental results show a substantial improvement in reducing the number of known bits of the private key to factor N. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-17533-1_7 | INFORMATION SECURITY PRACTICE AND EXPERIENCE, ISPEC 2015 |
Keywords | Field | DocType |
RSA, partial key exposure attack, lattice, Coppersmith's method | Discrete mathematics,Exponent,Lattice (order),Moduli,Prime factor,Public-key cryptography,Mathematics | Conference |
Volume | ISSN | Citations |
9065 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liqiang Peng | 1 | 38 | 8.37 |
| Lei Hu | 2 | 697 | 86.91 |
| Zhangjie Huang | 3 | 19 | 4.02 |
| Jun Xu | 4 | 8 | 3.51 |