A polynomial form for logarithms modulo a prime (Corresp.)

DOI10.1109/TIT.1984.1056986zbMath0558.12009OpenAlexW2165638380MaRDI QIDQ3222948

Albert L. jun. Wells

Publication date: 1984

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1984.1056986

zbMATH Keywords

code-breakinglogarithms modulo p

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Decoding (94B35) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (7)

Applying quick exponentiation for block upper triangular matrices ⋮ Closed formulae for the Weil pairing inversion ⋮ A note on discrete logarithms in finite fields ⋮ Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem ⋮ Transformations of Cryptographic Schemes Through Interpolation Techniques ⋮ On Polynomial Interpolations related to Verheul Homomorphisms ⋮ A short proof for explicit formulas for discrete logarithms in finite fields

This page was built for publication: A polynomial form for logarithms modulo a prime (Corresp.)