Daniel M. Gordon

25 papers A* 3Journal 18Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Modular Golomb Rulers and Almost Difference Sets.
IEEE Trans. Inf. Theory
Daniel M. Gordon
2023 J jnl
Signed difference sets.
Des. Codes Cryptogr.
Daniel M. Gordon
2021 J jnl
New nonexistence results on circulant weighing matrices.
Cryptogr. Commun.
K. T. Arasu, Daniel M. Gordon, Yiran Zhang
2016 J jnl
A survey of the multiplier conjecture.
Des. Codes Cryptogr.
Daniel M. Gordon, Bernhard Schmidt
2011 — ch.
Discrete Logarithm Problem.
Encyclopedia of Cryptography and Security (2nd Ed.)
Daniel M. Gordon
2011 — ch.
Generic Attacks Against DLP.
Encyclopedia of Cryptography and Security (2nd Ed.)
Daniel M. Gordon
2010 J jnl
On the density of the set of known Hadamard orders.
Cryptogr. Commun.
Warwick de Launey, Daniel M. Gordon
2010 J jnl
Optimal hash functions for approximate matches on the n-cube.
IEEE Trans. Inf. Theory
Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
2008 J jnl
Optimal hash functions for approximate closest pairs on the n-cube
CoRR
Daniel M. Gordon, Victor S. Miller, Peter Ostapenko
2006 J jnl
Perfect Single Error-Correcting Codes in the Johnson Scheme.
IEEE Trans. Inf. Theory
Daniel M. Gordon
2001 J jnl
A Comment on the Hadamard Conjecture.
J. Comb. Theory A
Warwick de Launey, Daniel M. Gordon
2001 J jnl
A remark on Plotkin's bound.
IEEE Trans. Inf. Theory
Warwick de Launey, Daniel M. Gordon
2000 — conf
Factoring Polynominals over
ANTS
David G. Cantor, Daniel M. Gordon
1998 J jnl
A Survey of Fast Exponentiation Methods.
J. Algorithms
Daniel M. Gordon
1998 — conf
Dense Admissible Sets.
ANTS
Daniel M. Gordon, Eugene R. Rodemich
1996 J jnl
Asymptotically Optimal Covering Designs.
J. Comb. Theory A
Daniel M. Gordon, Oren Patashnik, Greg Kuperberg, Joel Spencer
1996 J jnl
On sequences without geometric progressions.
Math. Comput.
Brienne E. Brown, Daniel M. Gordon
1994 J jnl
Minimum degree games for graphs.
Discret. Math.
Daniel M. Gordon, Robert W. Robinson, Frank Harary
1994 J jnl
The Prime Power Conjecture is True for n < 2, 000, 000.
Electron. J. Comb.
Daniel M. Gordon
1993 J jnl
Discrete Logarithms in
SIAM J. Discret. Math.
Daniel M. Gordon
1992 A* conf
Designing and Detecting Trapdoors for Discrete Log Cryptosystems.
CRYPTO
Daniel M. Gordon
1992 A* conf
Fast Exponentiation with Precomputation (Extended Abstract).
EUROCRYPT
Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson
1992 A* conf
Massively Parallel Computation of Discrete Logarithms.
CRYPTO
Daniel M. Gordon, Kevin S. McCurley
1991 J jnl
Parallel Sorting on Cayley Graphs.
Algorithmica
Daniel M. Gordon
1982 J jnl
Minimal permutation sets for decoding the binary Golay codes.
IEEE Trans. Inf. Theory
Daniel M. Gordon