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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
