Skip to main content
SpringerLink
Log in

Some Notes on the Linear Complexity of Sidel’nikov-Lempel-Cohn-Eastman Sequences

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We continue the study of the linear complexity of binary sequences, independently introduced by Sidel’nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Anuradha S. A. Katre (1999) ArticleTitleNumber of points on the projective curves aYl=bXl+cZl and aY2l=bX2l+cZ2l defined over finite fields, l an odd prime J. Number Th 77 288–313 Occurrence Handle2000h:11067

    MathSciNet  Google Scholar 

  2. B.C. Berndt R.J. Evans K.S. Williams (1998) Gauss and Jacobi sums, Canadian Mathematical Society Series of Monographs and Advanced Texts A Wiley-Interscience Publication. John Wiley & Sons, Inc. New York

    Google Scholar 

  3. S.R. Blackburn T. Etzion K.G. Paterson (1996) ArticleTitlePermutation polynomials, de Bruijn sequences, and linear complexity J. Combin. Theory Ser. A. 76 55–82 Occurrence Handle10.1006/jcta.1996.0088 Occurrence Handle97h:94004

    Article  MathSciNet  Google Scholar 

  4. T.W. Cusick C. Ding A. Renvall (1998) Stream Ciphers and Number Theory North-Holland Publishing Co. Amsterdam

    Google Scholar 

  5. L.E. Dickson (1935) ArticleTitleCyclotomy, higher congruences, and Waring’s problem Amer. J. Math 57 391–424 Occurrence Handle0012.01203 Occurrence Handle1507083

    MATH  MathSciNet  Google Scholar 

  6. C. Ding (1998) ArticleTitleLinear complexity of generalized cyclotomic binary sequences of order 2 Finite Fields and Applications 3 159–174

    Google Scholar 

  7. C. Ding T. Helleseth (1998) ArticleTitleOn cyclotomic generator of order r Inform. Process. Lett. 66 21–25 Occurrence Handle10.1016/S0020-0190(98)00025-8 Occurrence Handle99c:94029

    Article  MathSciNet  Google Scholar 

  8. C. Ding T. Helleseth W. Shan (1998) ArticleTitleOn the linear complexity of Legendre sequences, IEEE Trans. Inf. Th 44 1276–1278 Occurrence Handle99d:94017

    MathSciNet  Google Scholar 

  9. Eun Y.-C., Song H.-Y. (2004). One-error linear complexity over F p of SLCE sequences, in: Proc. (Extended Abstracts) Intern. Conf. on Sequences and their Applications, Seoul (2004) pp.39–43.

  10. M. Garaev, F. Luca, I. E. Shparlinski and A. Winterhof, On the linear complexity over \({\mathbb F}_{p}\) of Sidelnikov sequences, Preprint (2004).

  11. Granville A. (1997). Arithmetic properties of binomial coefficients I Binomial coefficients modulo prime powers. Burnaby BC. (ed.), Organic mathematics 1995 CMS Conf. Proc. 20, Amer. Math. Soc. Providence, RI, (1997) pp. 253–276.

  12. H. Hasse (1936) ArticleTitleTheorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenem Konstantenkörper bei beliebiger Charakteristik J. Reine. Angew. Math. 175 50–54 Occurrence Handle0013.34103

    MATH  Google Scholar 

  13. T. Helleseth S.-H. Kim J.-S. No (2003) ArticleTitleLinear complexity over \({\mathbb F}_{p}\) and trace representation of Lembel-Cohn-Eastman sequences IEEE Trans. Inform. Theory 49 1548–1552 Occurrence Handle10.1109/TIT.2003.811924 Occurrence Handle2004f:94052

    Article  MathSciNet  Google Scholar 

  14. T. Helleseth M. Maas J.E. Mathiassen T. Segers (2004) ArticleTitleLinear complexity over \({\mathbb F}_{p}\) of Sidel’nikov sequences IEEE Trans Inform Theory. 50 2468–2472 Occurrence Handle2097065

    MathSciNet  Google Scholar 

  15. T. Helleseth and K. Yang, On binary sequences with period n=pm−1 with optimal autocorrelation, In (T. Helleseth, P. Kumar, and K. Yang, (eds.), Proceedings of SETA 01 (2002) pp. 209–217.

  16. D. Jungnickel (1993) Finite Fields BI-Wissenschaftsverlag Mannheim

    Google Scholar 

  17. Kyureghyan GM., Pott A. (2003). On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences, Designs, Codes, and Cryptography Vol. 29 (2003) pp. 149–164.

  18. E. Lehmer (1955) ArticleTitleOn the number of solutions of uk+D≡ w2 (mod p) Pacific. J. Math. 5 103–118 Occurrence Handle0064.27803 Occurrence Handle16,798b

    MATH  MathSciNet  Google Scholar 

  19. A. Lempel M. Cohn W.L. Eastman (1977) ArticleTitleA class of balanced binary sequences with optimal autocorrelation properties IEEE. Trans. Inform. Th. 23 38–42 Occurrence Handle56 #2636

    MathSciNet  Google Scholar 

  20. R. Lidl H. Niederreiter (1983) Finite Fields Addison-Wesley Reading, MA

    Google Scholar 

  21. M.E. Lucas (1878) ArticleTitleSur les congruences des nombres euleriennes et des coefficients differentiels des fuctions trigonometriques, suivant un-module premier Bull. Soc. Math. France. 6 122–127

    Google Scholar 

  22. H.D. Lüke H.D. Schotten H. Hadinejad-Mahram (2000) ArticleTitleGeneralized Sidelnikov sequences with optimal autocorrelation properties Electronic Letters 36 525–527

    Google Scholar 

  23. W. Meidl A. Winterhof (2001) ArticleTitleLower bounds on the linear complexity of the discrete logarithm in finite fields IEEE. Trans. Inform. Th. 47 2807–2811 Occurrence Handle10.1109/18.959261 Occurrence Handle2003b:94079

    Article  MathSciNet  Google Scholar 

  24. W. Meidl A. Winterhof (2004) ArticleTitleOn the autocorrelation of cyclotomic generators Lecture Notes Comp. Sci. 2948 1–11 Occurrence Handle2005f:11281

    MathSciNet  Google Scholar 

  25. M.O. Rabin J.O Shallit (1986) ArticleTitleRandomized algorithms in number theory Comm. Pure Appl. Math. 39 239–256 Occurrence Handle88f:11120

    MathSciNet  Google Scholar 

  26. R.A. Rueppel (1986) Analysis and Design of Stream Ciphers Springer Berlin

    Google Scholar 

  27. I. Shparlinski (2003) Cryptographic Applications of Analytic Number Theory. Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic. 22. Birkhäuser Basel

    Google Scholar 

  28. I. Shparlinski, A. Winterhof, On the linear complexity of bounded integer sequences over different moduli, Preprint (2004).

  29. V. M. Sidel’nikov, Some k-valued pseudo-random sequences and nearly equidistant codes. Problems of Information Transmission Vol. 5 (1969) pp. 12–16; translated from Problemy Peredači Informacii Vol.5 (1969) pp. 16–22 (Russian).

  30. T. Storer (1967) Cyclotomy and Difference Sets Markham Publishing Co. Chicago, III

    Google Scholar 

  31. A. Winterhof (2004) A note on the linear complexity profile of the discrete logarithm in finite fields K.Q. Feng H. Niederreiter C.P. Xing (Eds) Coding Cryptography and Combinatorics Birkhäuser Basel 359–368

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Temasek Laboratories, National University of Singapore, 5 Sports Drive 2, 117508, Singapore

    Wilfried Meidl

  2. Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraße 69, A-4040, Linz, Austria

    Arne Winterhof

Authors
  1. Wilfried Meidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wilfried Meidl.

Additional information

Communicated by: D. Jungnickel

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meidl, W., Winterhof, A. Some Notes on the Linear Complexity of Sidel’nikov-Lempel-Cohn-Eastman Sequences. Des Codes Crypt 38, 159–178 (2006). https://doi.org/10.1007/s10623-005-6340-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-005-6340-2

Keywords

AMS Classification

Search

Navigation