Linear complexity of the discrete logarithm

DOI10.1023/A:1022584306676zbMath1024.11078MaRDI QIDQ1869823

Tanja Lange, Igor E. Shparlinski, Sergei V. Konyagin

Publication date: 28 April 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

linear complexitydiscrete logarithmlinear recurrence sequences

Mathematics Subject Classification ID

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

Related Items (4)

Polynomial representations of the Lucas logarithm ⋮ On the k-error linear complexity of cyclotomic sequences ⋮ Aitken and Neville inverse interpolation methods for the Lucas logarithm problem ⋮ On the complexity of the discrete logarithm and Diffie-Hellman problems

This page was built for publication: Linear complexity of the discrete logarithm