A note on discrete logarithms in finite fields

DOI10.1007/BF01189026zbMath0749.11055MaRDI QIDQ1196517

Gerasimos C. Meletiou, Gary L. Mullen

Publication date: 14 December 1992

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

zbMATH Keywords

finite fieldcryptographydiscrete logarithm

Mathematics Subject Classification ID

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

Related Items (11)

Studying the performance of artificial neural networks on problems related to cryptography ⋮ On \(r\)-primitive \(k\)-normal elements over finite fields ⋮ Pairs of \(r\)-primitive and \(k\)-normal elements in finite fields ⋮ Inverses of \(r\)-primitive \(k\)-normal elements over finite fields ⋮ r -primitive k -normal elements in arithmetic progressions over finite fields ⋮ Interpolation of the Double Discrete Logarithm ⋮ 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 ⋮ Transformations of Cryptographic Schemes Through Interpolation Techniques ⋮ Existence of primitive 2-normal elements in finite fields

Cites Work

• A short proof for explicit formulas for discrete logarithms in finite fields
• A polynomial form for logarithms modulo a prime (Corresp.)
• A polynomial representation for logarithms in GF(q)
• The Fast Fourier Transform in a Finite Field
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on discrete logarithms in finite fields