Skip to main content
SpringerLink
Log in

Maximal-Length Sequences

  • Reference work entry
Encyclopedia of Cryptography and Security

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 799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Chabaud F, Vaudenay S (1995) Links between differential and linear cryptanalysis. In De Santis A (ed) Advances in cryptology – EUROCRYPT’94, vol 950, Lecture notes in computer science, pp 356–365. Springer, Berlin

    Google Scholar 

  2. Golomb SW (1967) Shift register sequences. Holden-Day series in information systems. Holden-Day, San Francisco, 1967. Revised ed., Aegean Park Press, Laguna Hills

    Google Scholar 

  3. Golomb SW, Gong G (2005) Signal design for good correlation – for wireless communication, cryptography, and radar. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  4. Helleseth T (2009) Linear and nonlinear sequences and applications to stream ciphers. In Luengo I (ed) Recent trends in cryptography, vol 477, Contemporary mathematics, pp 21–46. American Mathematical Society, Providence, Rhode Island

    Google Scholar 

  5. Helleseth T, Vijay Kumar P (1998) Sequences with low correlation. In Pless VS, Huffman WC (eds), Handbook in coding theory, vol II, pp 1765–1853. Elsevier, Amsterdam

    Google Scholar 

  6. Helleseth T, Vijay Kumar P (2002) Pseudonoise sequences. In Gibson JD (ed) The communications handbook 2nd edn, pp 8–1–8–12. CRC Press, London

    Google Scholar 

  7. Nyberg K (1994) Differentially uniform mappings for cryptography. In Helleseth T (ed) Advances in cryptology - EUROCRYPT’93, vol 765 of Lecture notes in computer science, pp 55–64. Springer, Berlin

    Google Scholar 

  8. Selmer ES (1996) Linear recurrence relations over finite fields. Department of Mathematics, University of Bergen, Norway

    Google Scholar 

  9. Zierler N (1959) Linear recurring sequences. J Soc Ind Appl Math 7(1):31–48

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Selmer Center, Department of Informatics, University of Bergen, PB 7803, N-5020, Bergen, Norway

    Tor Helleseth

Authors
  1. Tor Helleseth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600 MB, Eindhoven, The Netherlands

    Henk C. A. van Tilborg

  2. Center for Secure Information Systems, George Mason University, Fairfax, VA, 22030-4422, USA

    Sushil Jajodia

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Helleseth, T. (2011). Maximal-Length Sequences. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_359

Download citation

Publish with us

Policies and ethics

Search

Navigation