Welcome to IOU Digital Library

This paper investigates the feasibility of computing discrete logarithms in finite fields, particularly those of characteristic 2 (i.e., fields like GF(2ⁿ)), which are widely used in cryptography. The authors implement a massively parallel version of Coppersmith’s algorithm—one of the fastest known methods for solving discrete logarithms in such fields—and introduce an improved technique for smoothness testing (a key step in the algorithm).

no reviews

245: $a: Massively Parallel Computation of Discrete Logarithms
245: $b:
082: $a:
100: $a: Daniel M. Gordon & Kevin S. McCurley
650: $a: Computer Science
250: $a:
440: $v:
250: $b: Springer Verlag
250: $c: 1998
020: $a:
300: $a: 12