On the k-error linear complexity over F-p of Legendre and Sidelnikov sequences
We determine exact values for the k-error linear complexity L (k) over the finite field F-p of the Legendre sequence L of period p and the Sidelnikov sequence T of period p(m)-1. The results are [GRAPHICS] L-k(T)>= min((p+1/2)(m)-1, [p(m)-1/k+1]-(p+1/2)(m) +1) for 1  =(p(m)-1)/2. In particular we prove L-k(T)=(p+1/2)(m)-1, 1 <= k <= 1/2(3/2)(m)-1.
linear complexity sidelnikov sequence legendre sequence cryptography