Name
Abstract | ||
|---|---|---|
We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the private exponent is available to the attacker. Our new attacks on RSA are the first attacks of this type that work up to full size public or private exponent. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11426639_22 | EUROCRYPT |
Keywords | Field | DocType |
new attack,private exponent,full size exponent,polynomial time,partial key exposure attack,full size public,significant bit,cryptanalysis,lattice reduction | Discrete mathematics,Exponent,Cryptography,Computer science,Cryptanalysis,Theoretical computer science,Time complexity,Lattice reduction | Conference |
Volume | ISSN | ISBN |
3494 | 0302-9743 | 3-540-25910-4 |
Citations | PageRank | References |
60 | 2.00 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Ernst | 1 | 60 | 2.00 |
| Ellen Jochemsz | 2 | 164 | 6.12 |
| Alexander May | 3 | 89 | 5.98 |
| Benne De Weger | 4 | 341 | 21.07 |