Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
crypt
|
| gptkbp:appliesTo |
gptkb:RSA_cryptosystem
modular polynomial equations |
| gptkbp:basedOn |
lattice basis reduction
|
| gptkbp:category |
public-key cryptography
cryptanalysis techniques |
| gptkbp:complexity |
polynomial time (for small roots)
|
| gptkbp:field |
cryptography
number theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Coppersmith's method
|
| gptkbp:introducedIn |
1996
|
| gptkbp:inventedBy |
gptkb:Don_Coppersmith
|
| gptkbp:notablePublication |
Don Coppersmith, 'Finding a Small Root of a Univariate Modular Equation', Eurocrypt 1996
|
| gptkbp:relatedTo |
gptkb:LLL_algorithm
gptkb:Wiener's_attack |
| gptkbp:significance |
can break RSA with small private exponent
|
| gptkbp:usedFor |
crypt
finding small roots of univariate modular equations |
| gptkbp:bfsParent |
gptkb:Don_Coppersmith
|
| gptkbp:bfsLayer |
7
|