Aitken and Neville inverse interpolation methods for the Lucas logarithm problem

DOI10.1016/j.amc.2008.06.014zbMath1157.94359OpenAlexW2142509518MaRDI QIDQ1008623

E. C. Laskari, Gerasimos C. Meletiou, Michael N. Vrahatis

Publication date: 30 March 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2008.06.014

zbMATH Keywords

discrete logarithminverse interpolationLucas functionAitken interpolationLucas logarithm problemNeville interpolation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Transformations of Cryptographic Schemes Through Interpolation Techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the security of the Lucas function
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• Incomplete character sums and polynomial interpolation of the discrete logarithm
• Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
• A polynomial representation of the Diffie-Hellman mapping
• Linear complexity of the discrete logarithm
• Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem
• Polynomial representations of the Lucas logarithm
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• Aitken and Neville Inverse Interpolation Methods over Finite Fields
• A polynomial representation for logarithms in GF(q)
• Polynomial interpolation of the discrete logarithm