Aitken and Neville Inverse Interpolation Methods over Finite Fields

In this contribution the application of two inverse interpolation methods over finite fields is studied. More specifically, we consider the Aitken and Neville inverse interpolation methods for a “shifted” discrete exponential function. The results indicate that the computational cost of finding the discrete logarithm through this approach remains high, however interesting features regarding the degree of the resulting interpolation polynomials are reported. c

[1]  Gary L. Mullen,et al.  A note on discrete logarithms in finite fields , 1992, Applicable Algebra in Engineering, Communication and Computing.

[2]  Tanja Lange,et al.  Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions , 2002 .

[3]  Gerasimos C. Meletiou,et al.  Explicit form for the discrete logarithm over the field ${\rm GF}(p,k)$ , 1993 .

[4]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[5]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[6]  Andrew M. Odlyzko,et al.  Discrete Logarithms: The Past and the Future , 2000, Des. Codes Cryptogr..

[7]  Arne Winterhof,et al.  Polynomial Interpolation of the Discrete Logarithm , 2002, Des. Codes Cryptogr..

[8]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[9]  Gary L. Mullen,et al.  A polynomial representation for logarithms in GF(q) , 1986 .

[10]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[11]  A. L. Wells,et al.  A polynomial form for logarithms modulo a prime , 1984, IEEE Trans. Inf. Theory.

[12]  Arne Winterhof,et al.  A note on the interpolation of the Diffie-Hellman mapping , 2001 .

[13]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[14]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[15]  Igor E. Shparlinski,et al.  Cryptographic applications of analytic number theory - complexity lower bounds and pseudorandomness , 2003, Progress in computer science and applied logic.

[16]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[17]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[18]  Harald Niederreiter,et al.  A short proof for explicit formulas for discrete logarithms in finite fields , 1990, Applicable Algebra in Engineering, Communication and Computing.

[19]  Ueli Maurer,et al.  The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms , 1999, SIAM J. Comput..

[20]  Leonard M. Adleman,et al.  A subexponential algorithm for the discrete logarithm problem with applications to cryptography , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[21]  Stephen C. Pohlig,et al.  An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance , 2022, IEEE Trans. Inf. Theory.

[22]  Gerasimos C. Meletiou.  A Polynomial Representation for Exponents in Zp , 1992 .

[23]  J. Miller.  Numerical Analysis , 1966, Nature.