Abstract
We determine exact values for the k-error linear complexity L k over the finite field \(\mathbb{F}_{p}\) of the Legendre sequence \(\mathcal{L}\) of period p and the Sidelnikov sequence \(\mathcal{T}\) of period p m − 1. The results are
for 1 ≤ k ≤ (p m − 3)/2 and \(L_k(\mathcal{T}) = 0\) for k≥ (p m − 1)/2. In particular, we prove
Similar content being viewed by others
References
ER Berlekamp (1968) Algebraic coding theory McGraw-Hill Book Co. New York-Toronto, Ont.-London Occurrence Handle0988.94521
S Blackburn T Etzion K Paterson (1996) ArticleTitlePermutation polynomials, de Bruijn sequences, and linear complexity J Comb Theory Series A 76 55–82 Occurrence Handle0871.11089 Occurrence Handle1405990 Occurrence Handle10.1006/jcta.1996.0088
Cusick T, Ding C, Renvall A (2004) Stream ciphers and number theory, North-Holland mathematical liberary, vol. 66, Elsevier
C Ding T Helleseth W Shan (1998) ArticleTitleOn the linear complexity of Legendre sequences IEEE Trans Inform Theory 44 IssueID3 1276–1278 Occurrence Handle1616704 Occurrence Handle10.1109/18.669398
Eun Y, Song H, Kyureghyan G (2005) One-error linear complexity over \(\mathbb{F}_p\) of Sidel’nikov sequences, sequences and their applications—SETA 2004: Third International Conference, Seoul, Korea, October 24–28, 2004. T. Helleseth et al. (eds) Lecture Notes Comput Sci 3486:154–165
Garaev M, Luca F, Shparlinski I, Winterhof A On the linear complexity over \(\mathbb{F}_p\) of Sidelnikov sequences. IEEE Trans Inform Theory (to appear)
T Helleseth S Kim J No (2003) ArticleTitleLinear complexity over \(\\mathbb{F}_p\) and trace representation Lempel–Cohen–Eastman sequences IEEE Trans Inform Theory 49 IssueID6 1584–1552 Occurrence Handle1984945 Occurrence Handle10.1109/TIT.2003.811924
T Helleseth M Maas J Mathiassen T Segers (2004) ArticleTitleLinear complexity over \(\\mathbb{F}_p\) of Sidelnikov sequences IEEE Trans Inform Theory 50 IssueID10 2468–2472 Occurrence Handle2097065 Occurrence Handle10.1109/TIT.2004.834854
Helleseth T, Yang K (2002) On binary sequences of period n = p m − 1 with optimal autocorrelation. Sequences and their applications (Bergen, 2001), Discrete Math Theor Comput Sci (Lond), Springer, London, pp 209–217
D Jungnickel (1993) Finite fields: structure and arithmetics Bibliographisches Institut Mannheim
G Kyureghyan A Pott (2003) ArticleTitleOn the linear complexity of Sidelnikov-Lempel–Cohen–Eastman sequences Des Codes Cryptogr 29 149–164 Occurrence Handle1034.94005 Occurrence Handle1993164 Occurrence Handle10.1023/A:1024156525801
ME Lucas (1878) ArticleTitleSur les congruences des nombres euleriennes et des coefficients difféntiels des functions trigonométriques, suivant un-module premier Bull Soc Math France 6 49–54 Occurrence Handle10.0139 Occurrence Handle1503769
JL Massey (1969) ArticleTitleShift-register synthesis and BCH decoding IEEE Trans Inform Theory IT- 15 122–127 Occurrence Handle0167.18101 Occurrence Handle242556 Occurrence Handle10.1109/TIT.1969.1054260
W Meidl A Winterhof (2006) ArticleTitleSome notes on the linear complexity of Sidelnikov–Lempel–Cohen–Eastman sequences Des Codes Cryptogr 38 159–178 Occurrence Handle05027943 Occurrence Handle2197466 Occurrence Handle10.1007/s10623-005-6340-2
AJ Menezes PC Oorschot Particlevan SA Vanstone (1997) Handbook of applied cryptography CRC Press Boca Raton, FL Occurrence Handle0868.94001
Niederreiter H (1999) Some computable complexity measures for binary sequences. Sequences and their applications (Singapore, 1998), Springer Ser Discrete Math Theor Comput Sci, Springer, London, pp 67–78
Niederreiter H (2003) Linear complexity and related complexity measures for sequences. Progress in cryptology—INDOCRYPT 2003, 1–17. Lecture Notes in Comput Sci, 2904, Springer, Berlin
Rueppel RA (1992) Stream ciphers. Contemporary cryptology, 65–134, IEEE, New York
Shparlinski I (2003) Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness, Birkhäuser Verlag
RJ Turyn (1964) ArticleTitleThe linear generation of Legendre sequence J Soc Indust Appl Math 12 115–116 Occurrence Handle0121.28304 Occurrence Handle162756 Occurrence Handle10.1137/0112010
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by A. Pott
Rights and permissions
About this article
Cite this article
Aly, H., Winterhof, A. On the k-error linear complexity over \(\mathbb{F}_p\) of Legendre and Sidelnikov sequences. Des Codes Crypt 40, 369–374 (2006). https://doi.org/10.1007/s10623-006-0023-5
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10623-006-0023-5