On the k-error linear complexity over F_p of Legendre and Sidelnikov sequences

DOI10.1007/S10623-006-0023-5MaRDI QIDQ851764zbMATH OpenOpenAlexFDO

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

Cryptography Legendre sequence Linear complexity Sidelnikov sequence

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

Recommendations

𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\mathbb{F}_d$
One-Error Linear Complexity over F p of Sidelnikov Sequences
On the k-error linear complexity of cyclotomic sequences
On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence

Cites work

Cryptographic applications of analytic number theory. Complexity lower bounds and pseudo\-randomness
scientific article; zbMATH DE number 1740058 (Why is no real title available?)
scientific article; zbMATH DE number 1972842 (Why is no real title available?)
scientific article; zbMATH DE number 2110656 (Why is no real title available?)
Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences
Permutation polynomials, de Bruijn sequences, and linear complexity
Progress in Cryptology - INDOCRYPT 2003
Shift-register synthesis and BCH decoding
Some notes on the linear complexity of Sidel'nikov-Lempel-Cohn-Eastman sequences
The Linear Generation of the Legendre Sequence

Cited in

(22)

On $k$-error linear complexity of pseudorandom binary sequences derived from Euler quotients
On the linear complexity of binary threshold sequences derived from Fermat quotients
A new lower bound on the family complexity of Legendre sequences
A kind of quaternary sequences of period $2 p^m q^n$ and their linear complexity
On the linear complexity of Legendre-Sidelnikov sequences
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
Character values of the Sidelnikov-Lempel-Cohn-Eastman sequences
Additive character sums of polynomial quotients
𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
scientific article; zbMATH DE number 1972837 (Why is no real title available?)
scientific article; zbMATH DE number 1972843 (Why is no real title available?)
On the $k$-error linear complexity of subsequences of $d$-ary Sidel'nikov sequences over prime field $\mathbb{F}_d$
On the k-error linear complexity of binary sequences derived from polynomial quotients
On the k-error linear complexity of cyclotomic sequences
One-Error Linear Complexity over F p of Sidelnikov Sequences
Improved results on periodic multisequences with large error linear complexity
On the pseudorandom properties of k-ary Sidel'nikov sequences
Balance, pattern distribution and linear complexity of $M$-ary sequences from Sidel'nikov sequences
The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation
Elliptic curve analogue of Legendre sequences

This page was built for publication: On the $k$-error linear complexity over ${\mathbb F}_p$ of Legendre and Sidelnikov sequences

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