ABSTRACT

Many cryptosystems could be broken if we could compute discrete logarithms quickly, that is, if we could solve the equation ax = b in a large finite field. For convenience of computation, usually the finite field is either the integers modulo a prime p or the field with 2 n elements.