On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
From MaRDI portal
Publication:2325205
DOI10.1155/2019/8635209zbMath1420.11146arXiv1901.10086OpenAlexW2954953846MaRDI QIDQ2325205
Publication date: 9 September 2019
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10086
Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On finite pseudorandom binary lattices
- Linear recursion properties of uncorrelated binary sequences
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- Measures of pseudorandomness for binary sequences constructed using finite fields
- Analysis and design of stream ciphers
- The stability theory of stream ciphers
- Permutation polynomials, de Bruijn sequences, and linear complexity
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- Lower bounds on the linear complexity of the discrete logarithm in finite fields
- Pattern distributions of Legendre sequences
- On the k-error linear complexity of cyclotomic sequences
- Trace representation of Legendre sequences
This page was built for publication: On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
