Abstract
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 a GF(2503) can definitely be attacked.
Author supplied keywords
Cite
CITATION STYLE
Gordon, D. M., & McCurley, K. S. (1993). Massively parallel computation of discrete logarithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 740 LNCS, pp. 312–323). Springer Verlag. https://doi.org/10.1007/3-540-48071-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
