Daniel M. Gordon

According to our database1, Daniel M. Gordon authored at least 21 papers between 1982 and 2016.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
A survey of the multiplier conjecture.
Des. Codes Cryptogr., 2016

2011
Generic Attacks Against DLP.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

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

2010
Optimal hash functions for approximate matches on the n-cube.
IEEE Trans. Information Theory, 2010

On the density of the set of known Hadamard orders.
Cryptography and Communications, 2010

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

2001
A remark on Plotkin's bound.
IEEE Trans. Information Theory, 2001

A Comment on the Hadamard Conjecture.
J. Comb. Theory, Ser. A, 2001

2000
Factoring Polynominals over p-Adic Fields.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1998
A Survey of Fast Exponentiation Methods.
J. Algorithms, 1998

Dense Admissible Sets.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1996
On sequences without geometric progressions.
Math. Comput., 1996

Asymptotically Optimal Covering Designs.
J. Comb. Theory, Ser. A, 1996

1994
Minimum degree games for graphs.
Discrete Mathematics, 1994

The Prime Power Conjecture is True for n < 2, 000, 000.
Electr. J. Comb., 1994

1993
Discrete Logarithms in GF(P) Using the Number Field Sieve.
SIAM J. Discrete Math., 1993

1992
Fast Exponentiation with Precomputation (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992

Massively Parallel Computation of Discrete Logarithms.
Proceedings of the Advances in Cryptology, 1992

Designing and Detecting Trapdoors for Discrete Log Cryptosystems.
Proceedings of the Advances in Cryptology, 1992

1991
Parallel Sorting on Cayley Graphs.
Algorithmica, 1991

1982
Minimal permutation sets for decoding the binary Golay codes.
IEEE Trans. Information Theory, 1982


  Loading...