A Subexponential-Time Algorithm for Computing Discrete Logarithms over GF(p 2)

DOI10.1007/978-1-4684-4730-9_22zbMath1492.11171OpenAlexW4250851148MaRDI QIDQ5019338

Taher Elgamal

Publication date: 8 January 2022

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

Full work available at URL: https://doi.org/10.1007/978-1-4684-4730-9_22

zbMATH Keywords

discrete logarithm problemquadratic fieldreal fielddiscrete logarithmquadratic residue

Mathematics Subject Classification ID

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

Cites Work

• On the distribution of quadratic residues modulo a prime
• New directions in cryptography
• Asymptotically Fast Factorization of Integers
• On factorisation, with a suggested new approach
• Number fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item