Fast Computation of Discrete Logarithms in GF (q)

DOI10.1007/978-1-4757-0602-4_1zbMATH Open0514.94013OpenAlexW1590338406WikidataQ56453953 ScholiaQ56453953MaRDI QIDQ3661465FDOQ3661465

Justin M. Reyneri, Martin Edward Hellman

Publication date: 1983

Published in: Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

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

Recommendations

• A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Computation of discrete logarithms in an arbitrary finite field
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• Discrete logarithms in \(\mathrm{GF}(p)\)

zbMATH Keywords

subexponential timecryptographyfinite fieldpartial precomputation

Mathematics Subject Classification ID

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

Cited In (4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661465)