Minimal permutation sets for decoding the binary Golay codes. - Daniel M. Gordon (IEEE Trans. Inf. Theory, 1982)

Parallel Sorting on Cayley Graphs. - Daniel M. Gordon (Algorithmica, 1991)

Designing and Detecting Trapdoors for Discrete Log Cryptosystems. - Daniel M. Gordon (CRYPTO, 1992)

Massively Parallel Computation of Discrete Logarithms. - Daniel M. Gordon; Kevin S. McCurley (CRYPTO, 1992)

Fast Exponentiation with Precomputation (Extended Abstract). - Ernest F. Brickell; Daniel M. Gordon; Kevin S. McCurley; David Bruce Wilson (EUROCRYPT, 1992)

Discrete Logarithms in GF(P) Using the Number Field Sieve. - Daniel M. Gordon (SIAM J. Discret. Math., 1993)

The Prime Power Conjecture is True for n < 2, 000, 000. - Daniel M. Gordon (Electron. J. Comb., 1994)

Minimum degree games for graphs. - Daniel M. Gordon; Robert W. Robinson; Frank Harary (Discret. Math., 1994)

Asymptotically Optimal Covering Designs. - Daniel M. Gordon; Oren Patashnik; Greg Kuperberg; Joel Spencer (J. Comb. Theory A, 1996)

On sequences without geometric progressions. - Brienne E. Brown; Daniel M. Gordon (Math. Comput., 1996)

Dense Admissible Sets. - Daniel M. Gordon; Eugene R. Rodemich (ANTS, 1998)

A Survey of Fast Exponentiation Methods. - Daniel M. Gordon (J. Algorithms, 1998)

Factoring Polynominals over p-Adic Fields. - David G. Cantor; Daniel M. Gordon (ANTS, 2000)

A Comment on the Hadamard Conjecture. - Warwick de Launey; Daniel M. Gordon (J. Comb. Theory A, 2001)

A remark on Plotkin's bound. - Warwick de Launey; Daniel M. Gordon (IEEE Trans. Inf. Theory, 2001)

Perfect Single Error-Correcting Codes in the Johnson Scheme. - Daniel M. Gordon (IEEE Trans. Inf. Theory, 2006)

Optimal hash functions for approximate closest pairs on the n-cube - Daniel M. Gordon; Victor S. Miller; Peter Ostapenko (CoRR, 2008)

On the density of the set of known Hadamard orders. - Warwick de Launey; Daniel M. Gordon (Cryptogr. Commun., 2010)

Optimal hash functions for approximate matches on the n-cube. - Daniel M. Gordon; Victor S. Miller; Peter Ostapenko (IEEE Trans. Inf. Theory, 2010)

Discrete Logarithm Problem. - Daniel M. Gordon (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)

Generic Attacks Against DLP. - Daniel M. Gordon (Encyclopedia of Cryptography and Security (2nd Ed.), 2011)

A survey of the multiplier conjecture. - Daniel M. Gordon; Bernhard Schmidt 001 (Des. Codes Cryptogr., 2016)

New nonexistence results on circulant weighing matrices. - K. T. Arasu 001; Daniel M. Gordon; Yiran Zhang (Cryptogr. Commun., 2021)

Signed difference sets. - Daniel M. Gordon (Des. Codes Cryptogr., 2023)

Modular Golomb Rulers and Almost Difference Sets. - Daniel M. Gordon (IEEE Trans. Inf. Theory, 2025)