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.
Received: 2008-12-30
Revised: 2009-09-07
Published Online: 2010-01-20
Published in Print: 2009-September
© de Gruyter 2009
This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.