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

DOI10.1515/156939203321669546zbMath1054.11065OpenAlexW2046120902MaRDI QIDQ4809607

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)

Related Items (6)

Bootstrapping for approximate homomorphic encryption ⋮ Computing discrete logarithms in \(\mathbb F_{p^6}\) ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields ⋮ The multiple number field sieve for medium- and high-characteristic finite fields

Cites Work

• Factoring polynomials with rational coefficients
• Unnamed Item

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