Skip to main content
SpringerLink
Log in

On the Linear Complexity of Generalised Legendre Sequence

  • Conference paper
Sequences and their Applications

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Summary

The linear complexity of a class of generalised Legendre sequences is characterized and determined. The result in this paper improves some related results in [6].

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. A. J. Bromfield, F. C. Piper, Linear recursion properties of unrelated binary sequences, Discr. Appl. Math., 1990, 27: 187–193.

    Article  MathSciNet  MATH  Google Scholar 

  2. I. Damgaard, On the randomness of Legendre and Jacobi sequences, in Advance in Cryptology: CRYPTO’88, Spring-Verlag, 1990, 163–172.

    Google Scholar 

  3. C. Sh. Ding, The differential cryptanalysis and design of the natrual stream ciphers, in Fast Software Encryption, Preneel B, Ed., Berlin, Germany: Springer-Verlag, LNCS 809, 1994, 101–115.

    Google Scholar 

  4. C. Sh. Ding, T. Helleseth, W. Shan, On the complexity of Legendre sequence, IEEE Transactions on IT, May 1998, 44(3): 1276–1278.

    Article  MathSciNet  Google Scholar 

  5. T. Helleseth, Legendre sums and codes related to QR codes, Discr. Appl. Math., 1992, 35: 107–113.

    Article  MathSciNet  MATH  Google Scholar 

  6. Y. P. Hu, Sh. M. Wei, G. Zh. Xiao, On the linear complexity of generalised Legendre/Jacobi sequences, DianZi XueBao (in Chinese), 2000, 28(2): 113–117.

    Google Scholar 

  7. R Lidl, H Niederreiter, “Finite Fields”, in Encyclopedia of Mathematics and Its Applications, Vol. 20, Reading, MA: Addison-Wesley, 1983.

    Google Scholar 

  8. S. A. Vanstone, R. J. Zucchrato, Elliptic curve cryptosystems using curves of smooth order over ring Zn, IEEE Transactions on IT, July 1997, 43(4): 1231–1237.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, Graduate School at Beijing, University of Science and Technology of China, 100039-08, Beijing, China

    Zongduo Dai & Ping Wang

  2. Institute of Software, Academic Sinica, 100080, Beijing, China

    Junhui Yang

  3. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada

    Guang Gong

Authors
  1. Zongduo Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junhui Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guang Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    T. Helleseth

  2. Communication Sciences Institute, Department of Electrical Engineering Systems, University of Southern California, 90089-2565, Los Angeles, CA, USA

    P. V. Kumar

  3. Department of Electronic and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    K. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this paper

Cite this paper

Dai, Z., Yang, J., Gong, G., Wang, P. (2002). On the Linear Complexity of Generalised Legendre Sequence. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0673-9_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-529-8

  • Online ISBN: 978-1-4471-0673-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation