Massively Parallel Computation of Discrete Logarithms

Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt to discover the size of fields of characteristic two for which the computation of discrete logarithms is feasible. We discover several things that were previously overlooked in the implementation of Coppersmith's algorithm, some positive, and some negative. As a result of this work we have shown that fields as large as GF(2503 ) can definitely be attacked.

• Type: Conference
• Year: 1992
• Where: CRYPTO
• Authors: Daniel M. Gordon, Kevin S. McCurley
• Keywords: Aggressive Attempt, CRYPTO 1992, Cryptology, Discrete Logarithms, Numerous Cryptosystems