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

DOI10.1109/TIT.1985.1057075zbMath0573.12006MaRDI QIDQ3691838

Taher Elgamal

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

finite fieldcryptographyquadratic fieldprobabilistic algorithmcomplexity analysissubexponential algorithmlogarithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20)

Related Items (10)

Elliptic divisibility sequences over the Edwards model of elliptic curves ⋮ Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\) ⋮ Computation of discrete logarithms in prime fields ⋮ A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields ⋮ On the security of the Lucas function ⋮ A note on cyclic groups, finite fields, and the discrete logarithm problem ⋮ Public-key cryptosystem based on invariants of diagonalizable groups ⋮ Using number fields to compute logarithms in finite fields ⋮ Complete addition formulas on the level four theta model of elliptic curves ⋮ Elliptic curve cryptosystems and their implementation

This page was built for publication: A subexponential-time algorithm for computing discrete logarithms over&lt;tex&gt;GF(p^2)&lt;/tex&gt;