A Polynomial Representation of the Diffie-Hellman Mapping

Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for 0 i d - 1 is described. In particular the exact degree and sparsity of f are determined.

• Type: Journal
• Year: 2002
• Where: AAECC
• Authors: Wilfried Meidl, Arne Winterhof
• Keywords: AAECC 2002, Algorithms, Exact Degree, Explicit Polynomial, Finite Field