Don Coppersmith

from Wikipedia, the free encyclopedia

Don Coppersmith (* around 1950) is an American mathematician and cryptologist .

Coppersmith studied at the Massachusetts Institute of Technology with a bachelor's degree in mathematics in 1972 and at Harvard University , where he received his master's degree in 1975 and his doctorate in 1977 under Shlomo Sternberg ( Deformation of Lie groups and Lie algebras ). As a student, he won the Putnam competition four times in a row from 1968 to 1971, making him a Putnam Fellow. He has been doing research at IBM since 1977 and was involved in the further development of the Data Encryption Standard , in particular the cryptanalysis of the S-boxes and their improvement against differential cryptanalysis . After this method had been published in 1990 by Eli Biham and Adi Shamir and it became clear that the S-boxes of the DES were optimized against it, Coppersmith revealed that the methods were already known to DES developers in the first half of the 1970s.

He later worked at the Center for Communication Research (CCR) at the Institute for Defense Analyzes in Princeton . He was involved in the development of the MARS block cipher at IBM, which was a candidate for the Advanced Encryption Standard, as well as in the development of the stream ciphers SEAL and Scream. He also dealt with the cryptanalysis of RSA , developed a very fast algorithm for the discrete logarithm (with applications in cryptography) and improved the number field sieve in factorization (also with a cryptographic background). He also studied the Mental Poker cryptographic protocols by Ron Rivest , Adi Shamir , Len Adleman .

With Shmuel Winograd he developed a fast algorithm for matrix multiplication (Coppersmith-Winograd algorithm).

From 1998 to 2002 he had an online entertainment math column at IBM ( Ponder this ).

He is a Fellow of the IEEE (1993) and the International Association for Cryptologic Research (2004). He received the IBM Outstanding Innovation Award. In 2002 he received the RSA Security Award in Mathematics.

Web links

Individual evidence

  1. ^ Mathematics Genealogy Project
  2. Coppersmith: The Data Encryption Standard (DES) and its strength against attacks , IBM J. Res. Dev., Volume 38, 1994, p. 243
  3. Bruce Schneier : Applied Cryptography , Wiley 1994, p. 240
  4. ^ Coppersmith: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities , Journal of Cryptology, Volume 10, 1997, pp. 233-260
  5. Coppersmith, Andrew M. Odlyzko , Richard Schroeppel : Discrete Logarithms in GF (p) , Algorithmica, Volume 1, 1986, pp. 1-15
  6. Coppersmith: Fast evaluation of logarithms in fields of characteristic two , IEEE Transactions on Information Theory, Volume 30, 1984, pp. 587-593, Evaluating logarithms in GF ( ) , STOC (ACM Symp. Theory Computing) 1984, p. 201 -207
  7. ^ Coppersmith: Modifications of the number field sieve , J. Cryptology, Volume 6, 1993, pp. 169-180
  8. ^ Cheating at Mental Poker , Advances in Cryptology, Crypto 85, Springer Verlag 1986, pp. 104-107
  9. ^ Coppersmith, Winograd: Matrix Multiplication via Arithmetic Progressions , J. Symbolic Computation, Volume 9, 1990, pp. 251-280
  10. ^ Ponder This, column at IBM
  11. Press release from IBM 2002