Linear complexity of the discrete logarithm

DOI10.1023/A:1022584306676zbMATH Open1024.11078MaRDI QIDQ1869823FDOQ1869823

Authors: Tanja Lange, Igor E. Shparlinski, Sergei Konyagin 

Publication date: 28 April 2003

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

Recommendations

• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• Number theoretic methods in cryptography. Complexity lower bounds
• scientific article; zbMATH DE number 1866875
• scientific article; zbMATH DE number 2127885

zbMATH Keywords

discrete logarithmlinear complexitylinear recurrence sequences

Mathematics Subject Classification ID

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

Cited In (6)

• Generic Hardness of the Multiple Discrete Logarithm Problem
• Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
• Polynomial representations of the Lucas logarithm
• On the complexity of the discrete logarithm and Diffie-Hellman problems
• Lower bounds on the linear complexity of the discrete logarithm in finite fields
• On the k-error linear complexity of cyclotomic sequences

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

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