Skip to main content
SpringerLink
Log in

Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants

  • Conference paper
Sequences and Their Applications – SETA 2006 (SETA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4086))

Included in the following conference series:

Abstract

Binary sequences generated by nonlinearly filtering maximal length sequences with period 2n–1 are studied in this paper. We focus on the particular class of equidistant filters and provide improved lower bounds on the linear complexity of the filtered sequences. This is achieved by first considering and proving properties of generalised Vandermonde determinants. Furthermore, it is shown that the methodology developed can be used for studying properties of any nonlinear filter.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Caballero-Gil, P.: Regular cosets and upper bounds on the linear complexity of certain sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications. Discrete Mathematics and Theoretical Computer Science, pp. 242–256. Springer, Berlin (1999)

    Google Scholar 

  2. Caballero-Gil, P., Fúster-Sabater, A.: A wide family of nonlinear filter functions with large linear span. Inform. Sci. 164, 197–207 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. García-Villalba, L.J., Fúster-Sabater, A.: On the linear complexity of the sequences generated by nonlinear filterings. Inform. Process. Lett. 76, 67–73 (2000)

    Article  MathSciNet  Google Scholar 

  4. Golomb, S.W.: Shift Register Sequences. Holden-Day Inc., San Francisco (1967)

    MATH  Google Scholar 

  5. Göttfert, R., Niederreiter, H.: On the linear complexity of products of shift-register sequences. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 151–158. Springer, Heidelberg (1994)

    Google Scholar 

  6. Göttfert, R., Niederreiter, H.: On the minimal polynomial of the product of linear recurring sequences. Finite Fields Applic. 1, 204–218 (1995)

    Article  MATH  Google Scholar 

  7. Groth, E.J.: Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory 17, 288–296 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  8. Key, E.L.: An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory 22, 732–736 (1976)

    Article  MATH  Google Scholar 

  9. Kolokotronis, N., Kalouptsidis, N.: On the linear complexity of nonlinearly filtered PN-sequences. IEEE Trans. Inform. Theory 49, 3047–3059 (2003)

    Article  MathSciNet  Google Scholar 

  10. Lam, C., Gong, G.: A lower bound for the linear span of filtering sequences. In: State of the Art of Stream Ciphers – SASC (2004), pp. 220–233 (2004)

    Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite Fields. In: Encyclop. Math. Its Applic., 2nd edn., vol. 20, Cambridge Univ. Press, Cambridge (1996)

    Google Scholar 

  12. Macdonald, I.G.: Symmetric Functions and Hall Polynomials, 2nd edn. Oxford Univ. Press, Oxford (1995)

    MATH  Google Scholar 

  13. Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory 15, 122–127 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  14. Massey, J.L., Serconek, S.: A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 332–340. Springer, Heidelberg (1994)

    Google Scholar 

  15. Paterson, K.G.: Root counting, the DFT and the linear complexity of nonlinear filtering. Des. Codes Cryptogr. 14, 247–259 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Berlin (1986)

    MATH  Google Scholar 

  17. Shparlinski, I.E.: On the singularity of generalised Vandermonde matrices over finite fields. Finite Fields Appl. 11, 193–199 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Tu, L.W.: A partial order on partitions and the generalised Vandermonde determinant. J. Algebra 278, 127–133 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics and Telecommunications, National and Kapodistrian University of Athens, TYPA Buildings, University Campus, 15784, Athens, Greece

    Nicholas Kolokotronis, Konstantinos Limniotis & Nicholas Kalouptsidis

Authors
  1. Nicholas Kolokotronis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Konstantinos Limniotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicholas Kalouptsidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Guang Gong

  2. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolokotronis, N., Limniotis, K., Kalouptsidis, N. (2006). Lower Bounds on Sequence Complexity Via Generalised Vandermonde Determinants. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_23

Download citation

  • DOI: https://doi.org/10.1007/11863854_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44523-4

  • Online ISBN: 978-3-540-44524-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation