Polynomial Interpolation of the Discrete Logarithm

Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field Fp by polynomials modulo p and modulo p -1, respectively. In this paper most of these results are extended to arbitrary Fpr .

• Type: Conference
• Year: 2002
• Where: DCC
• Authors: Arne Winterhof
• Keywords: Computer Graphics, DCC 2002, Prime Field Fp