Don Coppersmith
Papers
1
Total Citations
72
H-Index
1
About
Don Coppersmith is a towering figure in cryptography and combinatorial optimization, whose work has fundamentally shaped modern computational theory. Best known for the Coppersmith–Winograd algorithm for matrix multiplication, his research spans lattice-based cryptography, number theory, and algorithmic complexity. In his seminal paper "The Angular-Metric Traveling Salesman Problem" (2000, 72 citations), Coppersmith introduced a novel variant of the classic TSP, minimizing total angle cost rather than distance—a problem motivated by robotics and path planning. He proved the NP-hardness of this angular-metric formulation and its relaxation, establishing foundational complexity results that continue to influence geometric optimization. Beyond this, Coppersmith’s contributions to cryptography include the Coppersmith attack on RSA and the development of lattice reduction techniques, earning him over 20,000 total citations. A recipient of the IEEE Richard W. Hamming Medal, his work remains essential reading for researchers in algorithms, cryptography, and computational geometry.
Research Focus
Key Achievements
Top Papers
- 1The Angular-Metric Traveling Salesman Problem72 citations · 2000