A subexponential-time algorithm for computing discrete logarithms over GF(p^2)

DOI10.1007/978-1-4684-4730-9_22MaRDI QIDQ5019338zbMATH OpenOpenAlexFDO

Authors Taher Elgamal

Publication date 8 January 2022

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-4684-4730-9_22

zbMATH Keywords

discrete logarithmdiscrete logarithm problemquadratic fieldquadratic residuereal field

Mathematics Subject Classification ID

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

Recommendations

• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• scientific article; zbMATH DE number 1024052
• Fast Computation of Discrete Logarithms in GF (q)
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• scientific article; zbMATH DE number 799769

Cites work

• scientific article; zbMATH DE number 3159594 (Why is no real title available?)
• scientific article; zbMATH DE number 3877077 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3280208 (Why is no real title available?)
• Algebraic coding theory
• Asymptotically Fast Factorization of Integers
• New directions in cryptography
• Number fields
• On factorisation, with a suggested new approach
• On the distribution of quadratic residues modulo a prime

Cited in

(4)

• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Fast Computation of Discrete Logarithms in GF (q)
• Computing Logarithms in Finite Fields of Characteristic Two

This page was built for publication: A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)

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