𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period ( p r – 1)/3
Nina Brandstätter, Arne Winterhof · Journal of Mathematical Cryptology · 2009
Abstract Subsequences of Sidelnikov sequences have several desirable cryptographic features such as high linear complexity over 𝔽 2 and small aperiodic autocorrelation. Here we analyse the k -error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of length ( q –1)/3. The proofs are based on results on equations with binomial coefficients modulo p partly obtained using character sum techniques.