Don Coppersmith
Coppersmith's work spans the mathematics beneath practical cryptography and the analysis used to find when a system's parameters leave it vulnerable. His results remain reference points in RSA cryptanalysis and computer algebra.
Research at IBM
Don Coppersmith is a mathematician and cryptographer whose work at IBM Research has covered DES, discrete-logarithm algorithms and attacks on public-key systems. IBM's publication archive describes his work on both DES and the Diffie–Hellman setting.
Modular equations and cryptanalysis
Coppersmith is especially known in cryptography for methods for finding small roots of modular polynomial equations. Such techniques are useful when an implementation or protocol leaks enough structure to turn a hard number-theory problem into an attack. His research is a reminder that the security of a cryptosystem depends on parameter choices and implementation context, not only on its headline algorithm.
Timeline
- 1977Completes a PhD in mathematics at Harvard University.
- 1977Joins IBM's Thomas J. Watson Research Center.
- 1996Publishes work on finding small roots of univariate modular equations.
- 2000IBM publishes his overview article, Cryptography.
Don Coppersmith
- Type
- Person
- Era
- 1970s-Present
- Known for
- Coppersmith's method for small modular roots; DES research; RSA cryptanalysis
- Tags
- cryptography, mathematics, cryptanalysis, ibm-research
Created by Joas A Santos · Something wrong or want it removed? Open an issue.