A subexponential-time algorithm for computing discrete logarithms over GF(p^2)
DOI10.1007/978-1-4684-4730-9_22zbMATH Open1492.11171OpenAlexW4250851148MaRDI QIDQ5019338FDOQ5019338
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
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
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Algebraic coding theory
- New directions in cryptography
- Number fields
- Title not available (Why is that?)
- Asymptotically Fast Factorization of Integers
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the distribution of quadratic residues modulo a prime
- On factorisation, with a suggested new approach
Cited In (4)
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)
