2008 - IEEE Koji Kobayashi Computers and Communications Award “For outstanding achievement and ground breaking contributions in computational complexity and the theory and practice of cryptography”
Don Coppersmith spends much of his time researching Discrete mathematics, Combinatorics, Encryption, Matrix multiplication and Authentication. His Discrete mathematics research is multidisciplinary, incorporating elements of Travelling salesman problem, Latency and Approximation algorithm. Don Coppersmith has researched Combinatorics in several fields, including Logarithm, Polynomial, Function field sieve and Constant.
The Public-key cryptography and Plaintext research Don Coppersmith does as part of his general Encryption study is frequently linked to other disciplines of science, such as Signal processing, therefore creating a link between diverse domains of science. His research integrates issues of Block matrix and Diagonal matrix in his study of Matrix multiplication. The various areas that Don Coppersmith examines in his Diagonal matrix study include Involutory matrix, Nonnegative matrix and Invertible matrix.
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Algorithm, Encryption and Stream cipher. His Discrete mathematics study incorporates themes from Computation, Polynomial, Matrix multiplication and Prime. As a part of the same scientific family, Don Coppersmith mostly works in the field of Matrix multiplication, focusing on Block matrix and, on occasion, Diagonal matrix.
His work in the fields of Combinatorics, such as Random graph, Integer and Conjecture, intersects with other areas such as Bounded function. Don Coppersmith interconnects Hash function, Code and Arithmetic in the investigation of issues within Algorithm. Don Coppersmith works mostly in the field of Encryption, limiting it down to concerns involving Authentication and, occasionally, Public-key cryptography, Watermark, Image and Encoder.
Combinatorics, Discrete mathematics, Mathematical optimization, Function and IBM are his primary areas of study. His Combinatorics study frequently links to related topics such as Satisfiability. His work carried out in the field of Discrete mathematics brings together such families of science as Abelian group and Distribution.
The Distribution study combines topics in areas such as Algebra homomorphism and Prime. His work in Mathematical optimization addresses issues such as Scheduling, which are connected to fields such as Log-log plot and Linear programming. His Binary logarithm study deals with Rounding intersecting with Algorithm.
Don Coppersmith mostly deals with Combinatorics, Discrete mathematics, Graph, Bound graph and Euclidean geometry. His Combinatorics study integrates concerns from other disciplines, such as Algorithm and Simple. While working on this project, Don Coppersmith studies both Discrete mathematics and Bounded function.
His research on Graph frequently connects to adjacent areas such as Digraph. His Euclidean geometry research incorporates themes from Embedding, Independent set, Discrete geometry, Pairwise comparison and Vertex. The study incorporates disciplines such as Directed graph and Constant factor in addition to Distance labeling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Matrix multiplication via arithmetic progressions
Don Coppersmith;Shmuel Winograd.
Journal of Symbolic Computation (1990)
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
Journal of Cryptology (1997)
The Data Encryption Standard (DES) and its strength against attacks
Ibm Journal of Research and Development (1994)
The shrinking generator
Don Coppersmith;Hugo Krawczyk;Yishay Mansour.
international cryptology conference (1994)
Algorithms for sliding block codes---An application of symbolic dynamics to information theory
R. Adler;D. Coppersmith;M. Hassner.
IEEE Transactions on Information Theory (1983)
Fast evaluation of logarithms in fields of characteristic two
IEEE Transactions on Information Theory (1984)
Finding a small root of a univariate modular equation
theory and application of cryptographic techniques (1996)
System and method for near-field human-body coupling for encrypted communication with identification cards
Coppersmith Don;Raghavan Prabhakar;Zimmerman Thomas G.
The minimum latency problem
Avrim Blum;Prasad Chalasani;Don Coppersmith;Bill Pulleyblank.
symposium on the theory of computing (1994)
Discrete logarithms in GF ( p )
Don Coppersmith;Andrew M. Odlyzko;Richard Schroeppel.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: