On asymptotic complexity of computing discrete logarithms over GF(p)

DOI10.1515/156939203321669546MaRDI QIDQ4809607zbMATH OpenOpenAlexFDO

Authors D. V. Matyukhin

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203321669546

Mathematics Subject Classification ID

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

Recommendations

• Discrete logarithms in \(\mathrm{GF}(p)\)
• Computation of discrete logarithms in an arbitrary finite field
• scientific article; zbMATH DE number 4077312
• Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
• Public Key Cryptography - PKC 2006

Cites work

• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• Factoring polynomials with rational coefficients

Cited in

(11)

• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
• Polylog depth circuits for integer factoring and discrete logarithms
• On the Complexity of Computing Discrete Logarithms over Algebraic Tori
• The multiple number field sieve for medium- and high-characteristic finite fields
• Solving systems of linear equations arising in the computation of logarithms in a finite prime field
• Computing Logarithms in Finite Fields of Characteristic Two
• A Kilobit Hidden SNFS Discrete Logarithm Computation
• Bootstrapping for approximate homomorphic encryption
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Probabilistic analysis and performance modelling of the `Swedish' algorithm and modifications
• Discrete logarithms in \(\mathrm{GF}(p)\)

This page was built for publication: On asymptotic complexity of computing discrete logarithms over GF(p)

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