Don Coppersmith

Affiliations:
  • IDA Center for Communications Research, Princeton, NJ, USA


According to our database1, Don Coppersmith authored at least 99 papers between 1974 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 1993, "For contributions to cryptography and complexity theory.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2012
Binary Nontiles.
SIAM J. Discret. Math., 2012

2011
The optimality of the online greedy algorithm in carpool and chairman assignment problems.
ACM Trans. Algorithms, 2011

Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy.
Algorithmica, 2011

2010
Ordering by weighted number of wins gives a good ranking for weighted tournaments.
ACM Trans. Algorithms, 2010

2009
Binary Non-tiles
CoRR, 2009

2008
Improved Approximation Algorithms for Broadcast Scheduling.
SIAM J. Comput., 2008

Divisors in residue classes, constructively.
Math. Comput., 2008

Robust reductions from ranking to classification.
Mach. Learn., 2008

Cryptanalysis of ISO/IEC 9796-1.
J. Cryptol., 2008

2006
Sparse Sourcewise and Pairwise Distance Preservers.
SIAM J. Discret. Math., 2006

Testing set proportionality and the Ádám isomorphism of circulant graphs.
J. Discrete Algorithms, 2006

Minimizing Setup and Beam-On Times in Radiation Therapy.
Proceedings of the Approximation, 2006

2005
Constructive Bounds on Ordered Factorizations.
SIAM J. Discret. Math., 2005

Sparse Distance Preservers and Additive Spanners.
SIAM J. Discret. Math., 2005

On the Robust Testability of Product of Codes
Electron. Colloquium Comput. Complex., 2005

Parsimonious binary-encoding in integer programming.
Discret. Optim., 2005

Sparse source-wise and pair-wise distance preservers.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004
Random MAX SAT, random MAX CUT, and their phase transitions.
Random Struct. Algorithms, 2004

Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions
Electron. Colloquium Comput. Complex., 2004

An improved data stream algorithm for frequency moments.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003
Reconstructing curves in three (and higher) dimensional space from noisy data.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
The diameter of a long-range percolation graph.
Random Struct. Algorithms, 2002

Scream: a software-efficient stream cipher.
IACR Cryptol. ePrint Arch., 2002

Almost Optimal Hash Sequence Traversal.
IACR Cryptol. ePrint Arch., 2002

Cryptanalysis of stream ciphers with linear masking.
IACR Cryptol. ePrint Arch., 2002

2001
Weakness in Quaternion Signatures.
J. Cryptol., 2001

L Infinity Embeddings.
Proceedings of the Approximation, 2001

Finding Small Solutions to Small Degree Polynomials.
Proceedings of the Cryptography and Lattices, International Conference, 2001

2000
On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.
J. Cryptol., 2000

Euler circuits and DNA sequencing by hybridization.
Discret. Appl. Math., 2000

Key Recovery and Forgery Attacks on the MacDES MAC Algorithm.
Proceedings of the Advances in Cryptology, 2000

IBM Comments.
Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999
The Angular-Metric Traveling Salesman Problem.
SIAM J. Comput., 1999

Constructive bounds and exact expectations for the random assignment problem.
Random Struct. Algorithms, 1999

Lower Bounds on the Depth of Monotone Arithmetic Computations.
J. Complex., 1999

Partitioning Nominal Attributes in Decision Trees.
Data Min. Knowl. Discov., 1999

A structured symmetric-key block cipher.
Comput. Secur., 1999

Fragile imperceptible digital watermark with privacy control.
Proceedings of the Security and Watermarking of Multimedia Contents, 1999

1998
A Software-Optimized Encryption Algorithm.
J. Cryptol., 1998

Attacking Four-Round Luby-Rackoff Ciphers.
Cryptologia, 1998

New Bounds for Union-free Families of Sets.
Electron. J. Comb., 1998

Cryptanalysis of TWOPRIME.
Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Specialized Integer Factorization.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997
The Security of the Birational Permutation Signature Schemes.
J. Cryptol., 1997

Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities.
J. Cryptol., 1997

Rectangular Matrix Multiplication Revisited.
J. Complex., 1997

The data encryption standard.
Inf. Secur. Tech. Rep., 1997

Lattice Attacks on NTRU.
Proceedings of the Advances in Cryptology, 1997

1996
Linearity testing in characteristic two.
IEEE Trans. Inf. Theory, 1996

On a Question of Erdös on Subsequence Sums.
SIAM J. Discret. Math., 1996

Random Walks on Regular and Irregular Graphs.
SIAM J. Discret. Math., 1996

Efficient Routing in Optical Networks.
J. ACM, 1996

A proposed mode for triple-DES encryption.
IBM J. Res. Dev., 1996

The sizes of maximal planar, outerplanar, and bipartite planar subgraphs.
Discret. Math., 1996

Low-Exponent RSA with Related Messages.
Proceedings of the Advances in Cryptology, 1996

Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known.
Proceedings of the Advances in Cryptology, 1996

Finding a Small Root of a Univariate Modular Equation.
Proceedings of the Advances in Cryptology, 1996

1994
Hadamard transforms on multiply/add architectures.
IEEE Trans. Signal Process., 1994

The Data Encryption Standard (DES) and its strength against attacks.
IBM J. Res. Dev., 1994

The minimum latency problem.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Roots of a Polynomial and its Derivatives.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Efficient Routing and Scheduling Algorithms for Optical Networks.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Attack on the Cryptographic Scheme NIKS-TAS.
Proceedings of the Advances in Cryptology, 1994

1993
Collisions Among Random Walks on a Graph.
SIAM J. Discret. Math., 1993

Modifications to the Number Field Sieve.
J. Cryptol., 1993

Random Walks on Weighted Graphs and Applications to On-line Algorithms.
J. ACM, 1993

A Software-Optimised Encryption Algorithm.
Proceedings of the Fast Software Encryption, 1993

Attacks on the Birational Permutation Signature Schemes.
Proceedings of the Advances in Cryptology, 1993

The Shrinking Generator.
Proceedings of the Advances in Cryptology, 1993

1992
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1990
Matrix Multiplication via Arithmetic Progressions.
J. Symb. Comput., 1990

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Parallel Graph Algorithms That Are Efficient on Average
Inf. Comput., June, 1989

A Generalized Model for Understanding Evasiveness.
Inf. Process. Lett., 1989

1988
Balancing sets of vectors.
IEEE Trans. Inf. Theory, 1988

1987
Cryptography.
IBM J. Res. Dev., 1987

1986
Alphabetic Minimax Trees of Degree at Most t.
SIAM J. Comput., 1986

Discrete Logarithms in GF(p).
Algorithmica, 1986

1985
An Application of Factoring.
J. Symb. Comput., 1985

Each Four-Celled Animal Tiles the Plane.
J. Comb. Theory, Ser. A, 1985

Solving NP-hard problems in 'almost trees': Vertex cover.
Discret. Appl. Math., 1985

The Real Reason for Rivest's Phenomenon.
Proceedings of the Advances in Cryptology, 1985

Cheating at Mental Poker.
Proceedings of the Advances in Cryptology, 1985

Another Birthday Attack.
Proceedings of the Advances in Cryptology, 1985

1984
On the minimum distance of some quadratic residue codes.
IEEE Trans. Inf. Theory, 1984

Fast evaluation of logarithms in fields of characteristic two.
IEEE Trans. Inf. Theory, 1984

Evaluating Logarithms in GF(2^n)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
Algorithms for sliding block codes - An application of symbolic dynamics to information theory.
IEEE Trans. Inf. Theory, 1983

Optimal Wiring of Movable Terminals.
IEEE Trans. Computers, 1983

Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing.
IEEE Trans. Computers, 1983

1982
Minimizing Packet Waiting Time in a Multibeam Satellite System.
IEEE Trans. Commun., 1982

On the Asymptotic Complexity of Matrix Multiplication.
SIAM J. Comput., 1982

Analysis of a General Mass Storage System.
SIAM J. Comput., 1982

Rapid Multiplication of Rectangular Matrices.
SIAM J. Comput., 1982

1981
An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders.
IEEE Trans. Commun., 1981

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1976
The Generation of Permutations in Magnetic Bubble Memories.
IEEE Trans. Computers, 1976

1975
The Complement of Certain Recursively Defined Sets.
J. Comb. Theory, Ser. A, 1975

1974
A Combinatorial Problem Related to Multimodule Memory Organizations.
J. ACM, 1974


  Loading...