Abstract

A large variety of cryptosystems are based on the discrete log problem for various groups G. Specific groups that are being used are the multiplicative groups of large Galois fields [6], the multiplicative group of residues modulo a composite number [9, 10], elliptic curves over finite fields [11, 7] and the class group of imaginary quadratic fields [17].

Citations

1	Computing Fourier Transform over Sn in QP, unpublished - Beals - 1973