Polynomial Interpolation of the k-th Root of the Discrete Logarithm

  • Authors:
  • Gerasimos C. Meletiou

  • Affiliations:
  • A.T.E.I. of Epirus, Arta, Greece 47100

  • Venue:
  • CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the present study the problem of efficient computation of the k -th root of the Discrete Logarithm is investigated. Lower bounds on the degree of interpolation polynomials of the root of the Discrete Logarithm for subsets of given data are obtained. These results support the assumption of hardness of the k -th root of the discrete logarithm.