Fast Computation of Discrete Logarithms in GF (q)

DOI10.1007/978-1-4757-0602-4_1zbMath0514.94013OpenAlexW1590338406WikidataQ56453953 ScholiaQ56453953MaRDI QIDQ3661465

Justin M. Reyneri, Martin Edward Hellman

Publication date: 1983

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4757-0602-4_1

zbMATH Keywords

finite fieldcryptographysubexponential timepartial precomputation

Mathematics Subject Classification ID

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

Related Items (3)

Smoothness test for polynomials defined over small characteristic finite fields ⋮ Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\) ⋮ A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields

This page was built for publication: Fast Computation of Discrete Logarithms in GF (q)