A short proof for explicit formulas for discrete logarithms in finite fields

DOI10.1007/BF01810847zbMath0726.11079OpenAlexW2037158836MaRDI QIDQ802668

Harald Niederreiter

Publication date: 1990

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01810847

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields and commutative rings (number-theoretic aspects) (11T99)

Related Items

Studying the performance of artificial neural networks on problems related to cryptography, 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, Construction of logarithm tables for Galois Fields, On Polynomial Interpolations related to Verheul Homomorphisms, Incomplete character sums and polynomial interpolation of the discrete logarithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete logarithms in \(\mathrm{GF}(p)\)
• A polynomial form for logarithms modulo a prime (Corresp.)
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• A polynomial representation for logarithms in GF(q)