On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
From MaRDI portal
Publication:851764
DOI10.1007/s10623-006-0023-5zbMath1205.94069OpenAlexW2019640796MaRDI QIDQ851764
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-0023-5
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (15)
A new lower bound on the family complexity of Legendre sequences ⋮ On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences ⋮ A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity ⋮ Improved results on periodic multisequences with large error linear complexity ⋮ The linear complexity of binary sequences of length \(2p\) with optimal three-level autocorrelation ⋮ On the pseudorandom properties of \(k\)-ary Sidel'nikov sequences ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ Elliptic curve analogue of Legendre sequences ⋮ On the k-error linear complexity of cyclotomic sequences ⋮ 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3 ⋮ Trace representation of Legendre sequences over non-binary fields ⋮ On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields ⋮ Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
- Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Progress in Cryptology - INDOCRYPT 2003
- Shift-register synthesis and BCH decoding
- The Linear Generation of the Legendre Sequence
This page was built for publication: On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
