Computing discrete logarithms using O(( q)^2) operations from \+,-,,,\&\

DOI10.1515/GCC-2016-0009MaRDI QIDQ338831zbMATH OpenOpenAlexFDO

Authors Christian Schridde

Publication date 7 November 2016

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/gcc-2016-0009

zbMATH Keywords

base-\(p\) representationcryptographycyclic integersdiscrete logarithm problemFermat quotient

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Cryptography (94A60)

Recommendations

• Computation of discrete logarithms in an arbitrary finite field
• Discrete logarithms in \(\mathrm{GF}(p)\)
• scientific article; zbMATH DE number 1303121
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• scientific article; zbMATH DE number 1113854

Cites work

• Algorithms and Data Structures
• Factoring numbers in O(log n) arithmetic steps
• scientific article; zbMATH DE number 3592964 (Why is no real title available?)
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 2086896 (Why is no real title available?)
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• On Decimations of $\ell$-Sequences
• On Faster Integer Calculations Using Non-arithmetic Primitives
• On the Complexity of Numerical Analysis

This page was built for publication: Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)

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