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

DOI10.1109/18.959261zbMATH Open1032.94004OpenAlexW2149805018MaRDI QIDQ4544724FDOQ4544724

Authors: 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

Recommendations

• scientific article; zbMATH DE number 2127885
• Linear complexity of the discrete logarithm
• Interpolation of the discrete logarithm in \(\mathbb{F}_{q}\) by Boolean functions and by polynomials in several variables modulo a divisor of \(q-1\).
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences

zbMATH Keywords

discrete logarithmfinite fieldslinear complexityresidue class ringcyclotomic generatorMullen-White polynomial

Mathematics Subject Classification ID

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

Cited In (16)

• Title not available (Why is that?)
• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• Cryptography and Coding
• Aitken and Neville inverse interpolation methods for the Lucas logarithm problem
• Polynomial representations of the Lucas logarithm
• Advances in Cryptology – CRYPTO 2004
• Linear complexity of the discrete logarithm
• Measures of pseudorandomness for binary sequences constructed using finite fields
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
• On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
• Discrete logarithm like problems and linear recurring sequences
• Title not available (Why is that?)
• On the k-error linear complexity of cyclotomic sequences
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
• A shorter proof for an explicit formula for discrete logarithms in finite fields

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

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