Lower bounds on the linear complexity of the discrete logarithm in finite fields

DOI10.1109/18.959261zbMath1032.94004OpenAlexW2149805018MaRDI QIDQ4544724

Wilfried Meidl, Arne Winterhof

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.959261

zbMATH Keywords

finite fieldslinear complexityresidue class ringdiscrete logarithmcyclotomic generatorMullen-White polynomial

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences ⋮ 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 ⋮ Measures of pseudorandomness for binary sequences constructed using finite fields ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields

This page was built for publication: Lower bounds on the linear complexity of the discrete logarithm in finite fields