Lower bounds on the linear complexity of the discrete logarithm in finite fields
From MaRDI portal
Publication:4544724
DOI10.1109/18.959261zbMath1032.94004MaRDI 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
finite fields; linear complexity; residue class ring; discrete logarithm; cyclotomic generator; Mullen-White polynomial
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
Related Items
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, Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences, Polynomial representations of the Lucas logarithm