Skip to main content

Legendre Sequences and Modified Jacobi Sequences

  • Chapter
Progress on Cryptography

Part of the book series: The International Series in Engineering and Computer Science ((SECS,volume 769))

Abstract

In this paper, a survey of Legendre sequences and modified Jacobi sequences is presented, firstly. We introduce the construction and periodic autocorrelation functions of these two sequences (binary and polyphase). Then we determine the linear complexity of all modified polyphase Jacobi sequences and the corresponding feedback polynomials of the shortest linear feedback shift register that generates such a sequence. Making use of these results, at the same time, we prove the conjectures on the linear complexity and feedback polynomials of modified Jacobi sequences brought forward by D.H. Green and J. Choi.

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

Access this chapter

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
Hardcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Everett. Periodic digit sequences with pseudoradom properties. GEC J., 33, 1966.

    Google Scholar 

  2. P. Fan and M. Darnell. Sequence Design for Communications Applications. John Wiley, Research Studies Press, Taunton, 1996.

    Google Scholar 

  3. I. Damgaard. On the randomness of Legendre and Jacobi sequences. Advances in Cryptology: Crypto’88, Berlin, Germany: Springer-Verlage, LNCS 403, 1990.

    Google Scholar 

  4. J.H. Kim and H.Y. Song. Trace representation of Legendre sequences. Designs, Codes Cryptogr., 24(3), 2001.

    Google Scholar 

  5. C. Ding, T. Helleseth, and W. Shan. On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory, 44(3), 1998.

    Google Scholar 

  6. D.H. Green and P.R. Green. Modified Jocobi sequences. IEE Proc. Comput. Digit. Tech., 147(4), 2000.

    Google Scholar 

  7. D.H. Green and J. Choi. Linear complexity of modified Jacobi sequences. In IEE Proc. Comput. Digit. Tech., 149(3), 2002.

    Google Scholar 

  8. D.H. Green, M.D. Smith, and N. Martzoukos. Linear complexity of polyphase power residue sequence. IEE Proc. Commun., 149(4), 2002.

    Google Scholar 

  9. D.H. Green and P.R. Green. Polyphase related-prime sequences. IEE Proc. Comput. Digit. Tech., 148(2), 2001. MIT Press, Cambridge, MA, 1994.

    Google Scholar 

  10. D.H. Green. Structural properties of pseudorandom arrays and volumes and their related sequences. IEE Proc. Comput. Digit. Tech., 132(3), 1985.

    Google Scholar 

  11. R. Lidl and H. Niederreiter. Finite Fields. in Encyclopedia of Mathematics and Its Applications, vol.20, Reading, MA: Assison-Wesley, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Bai, E., Zhang, B. (2004). Legendre Sequences and Modified Jacobi Sequences. In: Chen, K. (eds) Progress on Cryptography. The International Series in Engineering and Computer Science, vol 769. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7987-7_2

Download citation

  • DOI: https://doi.org/10.1007/1-4020-7987-7_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7986-3

  • Online ISBN: 978-1-4020-7987-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics