Polynomial interpolation of the discrete logarithm

DOI10.1023/A:1012556500517zbMath1008.94015OpenAlexW1591996813MaRDI QIDQ5959834

Arne Winterhof

Publication date: 11 April 2002

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012556500517

zbMATH Keywords

finite fieldpolynomialsdegreelower boundssparsitydiscrete logarithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (10)

Studying the performance of artificial neural networks on problems related to cryptography ⋮ Carlitz rank and index of permutation polynomials ⋮ Interpolation of the Double Discrete Logarithm ⋮ Permutation polynomials with Carlitz rank 2 ⋮ Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Polynomial representations of the Lucas logarithm ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\). ⋮ Incomplete character sums and polynomial interpolation of the discrete logarithm

This page was built for publication: Polynomial interpolation of the discrete logarithm