Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)

DOI10.1515/gcc-2016-0009zbMath1354.94047OpenAlexW2530881395MaRDI QIDQ338831

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

cryptographydiscrete logarithm problemFermat quotientbase-\(p\) representationcyclic integers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
• Factoring numbers in O(log n) arithmetic steps
• On Faster Integer Calculations Using Non-arithmetic Primitives
• On the Complexity of Numerical Analysis
• On Decimations of $\ell$-Sequences
• Algorithms and Data Structures

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