Don Coppersmith

Don Coppersmith

Don Coppersmith is a cryptographer and mathematician. He was involved in the design of the Data Encryption Standard block cipher at IBM, particularly the design of the S-boxes, strengthening them against differential cryptanalysis.[1] He has also worked on algorithms for computing discrete logarithms, the cryptanalysis of RSA, methods for rapid matrix multiplication (see Coppersmith-Winograd algorithm) and IBM's MARS cipher. Don is also a co-designer of the SEAL and Scream ciphers.

In 1972, Coppersmith obtained a Bachelor's degree in mathematics at the Massachusetts Institute of Technology, and a Masters and PhD in mathematics from Harvard University in 1975 and 1977 respectively.[1] He was a Putnam Fellow each year from 1968–1971, becoming the first four-time Putnam Fellow in history. In 1998, he started Ponder This, an online monthly column on mathematical puzzles and problems. In October 2005, the column was taken over by James Shearer.[2]

In 2002, Coppersmith won the RSA Security Award for Mathematics.[3]

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Don Coppersmith — est un mathématicien et cryptologue américain. De 1968 à 1971, Coppersmith participe à la Putnam Mathematical Competition célèbre compétition universitaire aux États Unis et au Canada et arrive systématiquement dans les cinq premiers. En 1972, il …   Wikipédia en Français

  • Coppersmith's Attack — describes a class of attacks on the public key cryptosystem RSA based on Coppersmith s theorem (see below). The public key in the RSA system is a tuple of integers (N,e), where N is the product of two primes p and q. The secret key is given by an …   Wikipedia

  • Coppersmith (disambiguation) — Coppersmith may refer to: Coppersmith, a person who works with copper and brass Coppersmith Barbet, a bird found in India, Sri Lanka, southeast Asia and Indonesia Family name Don Coppersmith, a cryptographer and mathematician Sam Coppersmith, a… …   Wikipedia

  • Coppersmith — ist der Familienname folgender Personen: Don Coppersmith, US amerikanischer Mathematiker und Kryptologe Sam Coppersmith (* 1955), US amerikanischer Politiker Diese Seite ist eine Begriffsklärung zur Unterscheidung mehrerer mit demselben Wor …   Deutsch Wikipedia

  • Coppersmith–Winograd algorithm — In the mathematical discipline of linear algebra, the Coppersmith–Winograd algorithm, named after Don Coppersmith and Shmuel Winograd, is the asymptotically fastest known algorithm for square matrix multiplication as of 2008. It can multiply two… …   Wikipedia

  • Coppersmith method — The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer roots of polynomial equations. These polynomials can be univariate or bivariate. In cryptography the algorithm is mainly used in attacks on RSA when parts of… …   Wikipedia

  • Algorithme De Coppersmith-Winograd — L’algorithme de Coppersmith Winograd est un algorithme de calcul du produit de deux matrices carrées de taille n du à Don Coppersmith et Shmuel Winograd en 1987[1]. Sa complexité algorithmique est en ce qui en fait l algorithme le plus efficace… …   Wikipédia en Français

  • Algorithme de Coppersmith–Winograd — Algorithme de Coppersmith Winograd L’algorithme de Coppersmith Winograd est un algorithme de calcul du produit de deux matrices carrées de taille n du à Don Coppersmith et Shmuel Winograd en 1987[1]. Sa complexité algorithmique est en ce qui en… …   Wikipédia en Français

  • Algorithme de coppersmith-winograd — L’algorithme de Coppersmith Winograd est un algorithme de calcul du produit de deux matrices carrées de taille n du à Don Coppersmith et Shmuel Winograd en 1987[1]. Sa complexité algorithmique est en ce qui en fait l algorithme le plus efficace… …   Wikipédia en Français

  • Algorithme de Coppersmith-Winograd — L’algorithme de Coppersmith Winograd est un algorithme de calcul du produit de deux matrices carrées de taille n dû à Don Coppersmith et Shmuel Winograd en 1987[1]. Sa complexité algorithmique est en ce qui en fait l algorithme actuel le plus… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”