A polynomial representation for logarithms in GF(q)
From MaRDI portal
Publication:5187374
DOI10.4064/aa-47-3-255-261zbMath0562.12018OpenAlexW962054662MaRDI QIDQ5187374
No author found.
Publication date: 1986
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/206029
Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)
Related Items
Studying the performance of artificial neural networks on problems related to cryptography, Carlitz rank and index of permutation polynomials, Eulerian fractions and Stirling, Bernoulli and Euler functions with complex order parameters and their impact on the polylogarithm function, Interpolation of the Double Discrete Logarithm, Closed formulae for the Weil pairing inversion, A shorter proof for an explicit formula for discrete logarithms in finite fields, A note on discrete logarithms in finite fields, Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem, Polynomial representations of the Lucas logarithm, Transformations of Cryptographic Schemes Through Interpolation Techniques, 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\)., On certain summation problems and generalizations of Eulerian polynomials and numbers, A short proof for explicit formulas for discrete logarithms in finite fields, Incomplete character sums and polynomial interpolation of the discrete logarithm
