Name
Abstract | ||
|---|---|---|
We present several attacks on a variant of RSA due to Takagi when different parts of the private exponent are known to an attacker. We consider three cases when the exposed bits are the most significant bits, the least significant bits and the middle bits of the private exponent respectively. Our approaches are based on Coppersmith's method for finding small roots of modular polynomial equations. Our results extend the results of partial key exposure attacks on RSA of Ernst, Jochemsz, May and Weger (EUROCRYPT 2005) for moduli from N = pq to N = p(r)q (r >= 2). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-07536-5_9 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
RSA,partial key exposure,Coppersmith's method,lattice reduction,LLL algorithm | Exponent,Polynomial,Computer security,Computer science,Moduli,Modular design,Coppersmith,Lattice reduction | Conference |
Volume | ISSN | Citations |
8479 | 0302-9743 | 4 |
PageRank | References | Authors |
0.41 | 16 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhangjie Huang | 1 | 19 | 4.02 |
| Lei Hu | 2 | 697 | 86.91 |
| Jun Xu | 3 | 8 | 3.51 |
| Liqiang Peng | 4 | 38 | 8.37 |
| Yonghong Xie | 5 | 122 | 14.43 |