Don Coppersmith
#7,284
Most Influential Person Now
Cryptographer and mathematician
Don Coppersmith's AcademicInfluence.com Rankings
Don Coppersmithcomputer-science Degrees
Computer Science
#790
World Rank
#817
Historical Rank
#429
USA Rank
Don Coppersmithmathematics Degrees
Mathematics
#1070
World Rank
#1828
Historical Rank
#465
USA Rank
Algebraic Geometry
#137
World Rank
#144
Historical Rank
#33
USA Rank
Number Theory
#119
World Rank
#157
Historical Rank
#27
USA Rank
Measure Theory
#1325
World Rank
#1670
Historical Rank
#470
USA Rank
Download Badge
Computer Science Mathematics
Why Is Don Coppersmith Influential?
(Suggest an Edit or Addition)According to Wikipedia, 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. He also improved the quantum Fourier transform discovered by Peter Shor in the same year . He has also worked on algorithms for computing discrete logarithms, the cryptanalysis of RSA, methods for rapid matrix multiplication and IBM's MARS cipher. He is also a co-designer of the SEAL and Scream ciphers.
Don Coppersmith's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Matrix multiplication via arithmetic progressions (1987) (2902)
- Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities (1997) (749)
- The Data Encryption Standard (DES) and its strength against attacks (1994) (645)
- An approximate Fourier transform useful in quantum factoring", IBM Research Report RC19642 ,; R. Cle (2002) (359)
- Fast evaluation of logarithms in fields of characteristic two (1984) (345)
- The minimum latency problem (1994) (340)
- Finding a Small Root of a Univariate Modular Equation (1996) (328)
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory (1983) (291)
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known (1996) (290)
- A Combinatorial Problem Related to Multimodule Memory Organizations (1974) (272)
- On the asymptotic complexity of matrix multiplication (1981) (251)
- MARS - a candidate cipher for AES (1999) (240)
- Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm (1994) (240)
- Lattice Attacks on NTRU (1997) (232)
- The Shrinking Generator (1994) (223)
- Ordering by weighted number of wins gives a good ranking for weighted tournaments (2006) (194)
- Linearity testing in characteristic two (1995) (188)
- Almost Optimal Hash Sequence Traversal (2002) (186)
- Low-Exponent RSA with Related Messages (1996) (177)
- Efficient routing and scheduling algorithms for optical networks (1994) (163)
- Partitioning Nominal Attributes in Decision Trees (1999) (161)
- Rectangular Matrix Multiplication Revisited (1997) (145)
- Cryptanalysis of Stream Ciphers with Linear Masking (2002) (144)
- Random walks on weighted graphs and applications to on-line algorithms (1993) (143)
- Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing (1983) (140)
- A Software-Optimized Encryption Algorithm (1998) (126)
- The diameter of a long‐range percolation graph (2001) (111)
- Discrete logarithms inGF(p) (2005) (106)
- Random MAX SAT, random MAX CUT, and their phase transitions (2003) (105)
- An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders (1981) (100)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (1989) (96)
- Modifications to the Number Field Sieve (1993) (91)
- Solving linear equations over GF(2): block Lanczos algorithm (1993) (89)
- Attacks on the Birational Permutation Signature Schemes (1993) (88)
- An improved data stream algorithm for frequency moments (2004) (88)
- Sparse distance preservers and additive spanners (2003) (88)
- Balancing sets of vectors (1988) (86)
- The angular-metric traveling salesman problem (1997) (86)
- Efficient routing in optical networks (1996) (86)
- Finding Small Solutions to Small Degree Polynomials (2001) (85)
- Generators for Certain Alternating Groups with Applications to Cryptography (1975) (83)
- Reconstructing curves in three (and higher) dimensional space from noisy data (2003) (78)
- A proposed mode for triple-DES encryption (1996) (74)
- A Software-Optimised Encryption Algorithm (1993) (69)
- Constructive bounds and exact expectations for the random assignment problem (1998) (69)
- Sparse Sourcewise and Pairwise Distance Preservers (2006) (68)
- Self-orthogonal latin squares of all orders $n \ne 2,3,6$ (1974) (67)
- The growth of polynomials bounded at equally spaced points (1992) (67)
- Constructive bounds and exact expectation for the random assignment problem (1999) (62)
- Another Birthday Attack (1986) (61)
- Random Walks on Regular and Irregular Graphs (1996) (60)
- Fragile imperceptible digital watermark with privacy control (1999) (56)
- Scream: A Software-Efficient Stream Cipher (2002) (55)
- Optimal Wiring of Movable Terminals (1983) (53)
- Euler circuits and DNA sequencing by hybridization (2000) (52)
- Collisions Among Random Walks on a Graph (1993) (49)
- Improved approximation algorithms for broadcast scheduling (2006) (46)
- Minimizing Packet Waiting Time in a Multibeam Satellite System (1982) (42)
- The data encryption standard (1997) (42)
- The security of the birational permutation signature schemes (1997) (42)
- On the minimum distance of some quadratic residue codes (1984) (42)
- Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions (2008) (38)
- Parallel graph algorithms that are efficient on average (1987) (38)
- Sparse source-wise and pair-wise distance preservers (2005) (36)
- The Real Reason for Rivest's Phenomenon (1985) (36)
- Random walks on weighted graphs, and applications to on-line algorithms (1990) (36)
- New Bounds for Union-free Families of Sets (1998) (32)
- Robust reductions from ranking to classification (2007) (31)
- Minimizing Setup and Beam-On Times in Radiation Therapy (2006) (29)
- Evaluating logarithms in GF(2n) (1984) (26)
- Rapid Multiplication of Rectangular Matrices (1982) (25)
- On the Robust Testability of Product of Codes (2005) (24)
- The Generation of Permutations in Magnetic Bubble Memories (1976) (24)
- Cheating at Mental Poker (1985) (23)
- Key Recovery and Forgery Attacks on the MacDES MAC Algorithm (2000) (22)
- Conditions for weak ergodicity of inhomogeneous Markov chains (2008) (21)
- The optimality of the online greedy algorithm in carpool and chairman assignment problems (2011) (21)
- Iso 9796-1 and the new forgery strategy (1999) (20)
- SELF-ORTHOGONAL LATIN SQUARES (2003) (20)
- Roots of a polynomial and its derivatives (1994) (20)
- A Divide-and-conquer Algorithm for Identifying Strongly Connected Components ? (2003) (17)
- Hadamard transforms on multiply/add architectures (1994) (17)
- Polynomials whose powers are sparse (1991) (17)
- The MARS Encryption Algorithm (1999) (17)
- Solving NP-hard problems in 'almost trees': Vertex cover (1985) (16)
- An elementary proof of nonexistence of isometries between l p k and l q k (1979) (15)
- On the expected incremental cost of a minimum assignment (2002) (15)
- Alphabetic Minimax Trees of Degree at Most t (1986) (13)
- Fermat’s last theorem (case 1) and the Wieferich criterion (1990) (13)
- ON THE ENTRY SUM OF CYCLOTOMIC ARRAYS (2006) (12)
- Divisors in residue classes, constructively (2008) (12)
- On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping (2015) (11)
- Attacks on MacDES MAC algorithm (1999) (11)
- Cryptanalysis of ISO/IEC 9796-1 (2008) (11)
- About the optimal density associated to the chiral index of a sample from a bivariate distribution (2005) (11)
- The sizes of maximal planar, outerplanar, and bipartite planar subgraphs (1996) (10)
- Counting De Bruijn sequences as perturbations of linear recursions (2017) (10)
- Advances in Cryptology — CRYPT0’ 95 (2001) (10)
- Parsimonious binary-encoding in integer programming (2005) (10)
- An Application of Factoring (1985) (9)
- Random walk on upper triangular matrices mixes rapidly (2000) (8)
- On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) (1981) (7)
- A family of Lie algebras not extendible to a family of Lie groups (1977) (7)
- Cryptanalysis of TWOPRIME (1998) (7)
- Constructive Bounds on Ordered Factorizations (2005) (6)
- A Generalized Model for Understanding Evasiveness (1989) (6)
- Attack on the Cryptographic Scheme NIKS-TAS (1994) (6)
- IBM Research Report The Optimality of the On-Line Greedy Algorithm in Carpool and Chairman Assignment Problems (2005) (5)
- Each Four-Celled Animal Tiles the Plane (1985) (4)
- A structured symmetric-key block cipher (1999) (4)
- Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings (1995) (4)
- Lower bounds on the depth of monotone arithmetic computations (1992) (4)
- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy (2011) (4)
- Deformations of Lie subgroups (1977) (3)
- Weakness in Quaternion Signatures (1999) (3)
- Analysis of a General Mass Storage System (1982) (3)
- Specialized Integer Factorization (1998) (2)
- Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology (1995) (2)
- The Complement of Certain Recursively Defined Sets (1975) (2)
- How to Multiply Matrices Faster (Victor Pan) (1986) (2)
- On the singularity of matrices (2005) (2)
- Binary Non-tiles (2009) (1)
- I he Data (1994) (1)
- Inequalities of Rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices (1997) (1)
- ON CAYLEY'S FORMULA FOR COUNTING TREES IN NESTED INTERVAL GRAPHS ∗ (2004) (1)
- Testing set proportionality and the Ádám isomorphism of circulant graphs (2006) (1)
- On a Question of Erdös on Subsequence Sums (1996) (1)
- Indivisibility and divisibility polytopes (2000) (1)
- On two criteria for infinite random sequences (1974) (0)
- Knapsack Used in Factoring (1987) (0)
- Binary Nontiles (2012) (0)
- IBM Comments (2000) (0)
- Linearity Testing in Characteristic Two-Information Theory, IEEE Transactions on (2004) (0)
- FERMAT ' S LAST THEOREM AND THE WIEFERICH CRITERION (2010) (0)
- Note Each Four-Celled Animal Tiles the Plane (1985) (0)
- On curves contained in convex subsets of the plane (2005) (0)
- L Infinity Embeddings (2001) (0)
- IBM Research Report Parsimonious Binary-Encoding In Integer Programming (2003) (0)
- IBM Research Report Constructive Bounds on Ordered Factorizations (2004) (0)
- Algorithms for Slid ing Block Codes (1998) (0)
- Core Discussion Paper 2000/xx Indivisibility and Divisibility Polytopes (2000) (0)
- Ciphering method/system (1994) (0)
- Aumann and Rabani On-line Admission Control and Circuit Routing for High Performance Computing and Communication. 4.2 from Throughput to Realization 5 Routing on the Hypercube (0)
- Cryptography (2019) (0)
- Method and apparatus for generating watermarks for records (1999) (0)
- Attacking Four-Round Luby-Rackoff Ciphers (1998) (0)
- Comments on this document that have been incorporated were received from (in alphabetic order) the following (1994) (0)
- A Polytope for a Product of Real Linear Functionsin 0 = 1 VariablesDon Coppersmith (1999) (0)
- Ciphering method and device (1994) (0)
- Electronic communication device that uses the human body as a transmission medium. (1997) (0)
- Review of Contemporary cryptology: the science of information integrity by Gustavus J. Simmons, IEEE Press 1992 (1993) (0)
- I He Data Encryption Standard (des) and Its Strength against Attacks People at Two Ibm Sites (kingston and Yorktown Heights, New York). Developers Included (1977) (0)
- Proof. Reduction from Planar 3-sat. 2 5 Conclusions 4 Translators in General Wdm Networks (1998) (0)
- Generating a cryptographic key by use of sequential link (1994) (0)
- Ideal solutions in the Prouhet-Tarry-Escott problem (2023) (0)
- Low-Exponent RSA with Related MessagesDon Coppersmith (1996) (0)
- Distribution of the minimum channel width wiring (1987) (0)
This paper list is powered by the following services:
Other Resources About Don Coppersmith
What Schools Are Affiliated With Don Coppersmith?
Don Coppersmith is affiliated with the following schools:
