Daniel M. Gordon

According to our database, Daniel M. Gordon authored at least 24 papers between 1982 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Signed difference sets.

Daniel M. Gordon

Des. Codes Cryptogr., May, 2023

2021

New nonexistence results on circulant weighing matrices.

K. T. Arasu, Daniel M. Gordon, Yiran Zhang

Cryptogr. Commun., 2021

2016

A survey of the multiplier conjecture.

Daniel M. Gordon, Bernhard Schmidt

Des. Codes Cryptogr., 2016

2011

Generic Attacks Against DLP.

Daniel M. Gordon

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Discrete Logarithm Problem.

Daniel M. Gordon

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

2010

Optimal hash functions for approximate matches on the n-cube.

Daniel M. Gordon, Victor S. Miller, Peter Ostapenko

IEEE Trans. Inf. Theory, 2010

On the density of the set of known Hadamard orders.

Warwick de Launey, Daniel M. Gordon

Cryptogr. Commun., 2010

2008

Optimal hash functions for approximate closest pairs on the n-cube

Daniel M. Gordon, Victor S. Miller, Peter Ostapenko

CoRR, 2008

2006

Perfect Single Error-Correcting Codes in the Johnson Scheme.

Daniel M. Gordon

IEEE Trans. Inf. Theory, 2006

2001

A remark on Plotkin's bound.

Warwick de Launey, Daniel M. Gordon

IEEE Trans. Inf. Theory, 2001

A Comment on the Hadamard Conjecture.

Warwick de Launey, Daniel M. Gordon

J. Comb. Theory, Ser. A, 2001

2000

Factoring Polynominals over <i>p</i>-Adic Fields.

David G. Cantor, Daniel M. Gordon

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1998

A Survey of Fast Exponentiation Methods.

Daniel M. Gordon

J. Algorithms, 1998

Dense Admissible Sets.

Daniel M. Gordon, Eugene R. Rodemich

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1996

On sequences without geometric progressions.

Brienne E. Brown, Daniel M. Gordon

Math. Comput., 1996

Asymptotically Optimal Covering Designs.

Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer

J. Comb. Theory, Ser. A, 1996

1994

Minimum degree games for graphs.

Daniel M. Gordon, Robert W. Robinson, Frank Harary

Discret. Math., 1994

The Prime Power Conjecture is True for n < 2, 000, 000.

Daniel M. Gordon

Electron. J. Comb., 1994

1993

Discrete Logarithms in <i>GF(P)</i> Using the Number Field Sieve.

Daniel M. Gordon

SIAM J. Discret. Math., 1993

1992

Fast Exponentiation with Precomputation (Extended Abstract).

Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson

Proceedings of the Advances in Cryptology, 1992

Massively Parallel Computation of Discrete Logarithms.

Daniel M. Gordon, Kevin S. McCurley

Proceedings of the Advances in Cryptology, 1992

Designing and Detecting Trapdoors for Discrete Log Cryptosystems.

Daniel M. Gordon

Proceedings of the Advances in Cryptology, 1992

1991

Parallel Sorting on Cayley Graphs.

Daniel M. Gordon

Algorithmica, 1991

1982

Minimal permutation sets for decoding the binary Golay codes.

Daniel M. Gordon

IEEE Trans. Inf. Theory, 1982