Coppersmith method

E1724465 UNEXPLORED

The Coppersmith method is a number-theoretic algorithm used to find small roots of polynomial equations modulo an integer, with major applications in cryptanalysis and attacks on RSA.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (4)

Label Occurrences
Coppersmith method canonical 1
Coppersmith’s algorithm for finding small roots of bivariate modular equations 1
Coppersmith’s algorithm for finding small roots of univariate modular equations 1

Referenced by (4)

Full triples — surface form annotated when it differs from this entity's canonical label.

Don Coppersmith → notableWork → Coppersmith method ⓘ
Don Coppersmith → notableWork → Coppersmith’s algorithm for finding small roots of univariate modular equations ⓘ
linked to: Coppersmith method
Don Coppersmith → notableWork → Coppersmith’s algorithm for finding small roots of bivariate modular equations ⓘ
linked to: Coppersmith method
Wiener’s attack on RSA → relatedTo → Coppersmith’s method ⓘ
linked to: Coppersmith method