Advertisement

Designs, Codes and Cryptography

, Volume 40, Issue 3, pp 369–374 | Cite as

On the k-error linear complexity over \(\mathbb{F}_p\) of Legendre and Sidelnikov sequences

  • Hassan Aly
  • Arne WinterhofEmail author
Article

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
$$ L_k(\mathcal{L}) =\left\{\begin{array}{ll} (p+1)/2, \quad 1 \le k \le (p-3)/2,\\ 0, \quad k\ge (p-1)/2, \end{array}\right.$$
$$L_k(\mathcal{T})\ge \min \left( \left( \frac{p+1}{2} \right)^{m}-1, \left \lceil \frac{p^m-1}{k+1} \right \rceil - \left(\frac{p+1}{2} \right)^{m} + 1 \right)$$
for 1 ≤ k ≤ (p m  − 3)/2 and \(L_k(\mathcal{T}) = 0\) for k≥ (p m  − 1)/2. In particular, we prove
$$L_k(\mathcal{T}) = \left(\frac{p+1}{2} \right)^{m}-1,\quad 1\le k\le \frac{1}{2}\left(\frac{3}{2}\right)^{m}-1.$$

Keywords

Linear complexity Legendre sequence Sidelnikov sequence Cryptography 

AMS Classification

94A55 11T71 94A60 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berlekamp, ER 1968Algebraic coding theoryMcGraw-Hill Book Co.New York-Toronto, Ont.-LondonzbMATHGoogle Scholar
  2. 2.
    Blackburn, S, Etzion, T, Paterson, K 1996Permutation polynomials, de Bruijn sequences, and linear complexityJ Comb Theory Series A765582zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Cusick T, Ding C, Renvall A (2004) Stream ciphers and number theory, North-Holland mathematical liberary, vol. 66, ElsevierGoogle Scholar
  4. 4.
    Ding, C, Helleseth, T, Shan, W 1998On the linear complexity of Legendre sequencesIEEE Trans Inform Theory4412761278MathSciNetCrossRefGoogle Scholar
  5. 5.
    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–165Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Helleseth, T, Kim, S, No, J 2003Linear complexity over \(\\mathbb{F}_p\) and trace representation Lempel–Cohen–Eastman sequencesIEEE Trans Inform Theory4915841552MathSciNetCrossRefGoogle Scholar
  8. 8.
    Helleseth, T, Maas, M, Mathiassen, J, Segers, T 2004Linear complexity over \(\\mathbb{F}_p\) of Sidelnikov sequencesIEEE Trans Inform Theory5024682472MathSciNetCrossRefGoogle Scholar
  9. 9.
    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–217Google Scholar
  10. 10.
    Jungnickel, D 1993Finite fields: structure and arithmeticsBibliographisches InstitutMannheimGoogle Scholar
  11. 11.
    Kyureghyan, G, Pott, A 2003On the linear complexity of Sidelnikov-Lempel–Cohen–Eastman sequencesDes Codes Cryptogr29149164zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Lucas, ME 1878Sur les congruences des nombres euleriennes et des coefficients difféntiels des functions trigonométriques, suivant un-module premierBull Soc Math France64954zbMATHMathSciNetGoogle Scholar
  13. 13.
    Massey, JL 1969Shift-register synthesis and BCH decodingIEEE Trans Inform Theory IT-15122127zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Meidl, W, Winterhof, A 2006Some notes on the linear complexity of Sidelnikov–Lempel–Cohen–Eastman sequencesDes Codes Cryptogr38159178zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Menezes, AJ, Oorschot, PC, Vanstone, SA 1997Handbook of applied cryptographyCRC PressBoca Raton, FLCRC press series on discrete mathematics and its applications.zbMATHGoogle Scholar
  16. 16.
    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–78Google Scholar
  17. 17.
    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, BerlinGoogle Scholar
  18. 18.
    Rueppel RA (1992) Stream ciphers. Contemporary cryptology, 65–134, IEEE, New YorkGoogle Scholar
  19. 19.
    Shparlinski I (2003) Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness, Birkhäuser VerlagGoogle Scholar
  20. 20.
    Turyn, RJ 1964The linear generation of Legendre sequenceJ Soc Indust Appl Math12115116zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Mathematics, Faculty of ScienceCairo UniversityGizaEgypt
  2. 2.Johann Radon Institute for Computational and Applied Mathematics (RICAM)Austrian Academy of SciencesLinzAustria

Personalised recommendations