Skip to main content
SpringerLink
Log in

On the d-ary Generalized Legendre-Sidelnikov Sequence

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

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

Included in the following conference series:

Abstract

We generalize the Legendre-Sidelnikov sequence to d-ary balanced sequence by using multiplicative character, where d is a common divisor of p − 1 and q − 1; p is an odd prime and q a power of an odd prime, and \(\gcd(p,q-1)=1\). Then with character sums we analyze some important pseudorandomness measures including (aperiodic) autocorrelation, power correlation of measure of order k, and linear complexity profile. Results show that aperiodic autocorrelation and power correlation measure of order 2 are ideal in terms of order of magnitude of a good pseudorandom sequence.

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. Cassaigne, J., Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences. VII. The measures of pseudorandomness. Acta Arith. 103, 97–118 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, Z., Winterhof, A.: Linear complexity profile of m-ary psudorandom sequences with small correlation measure. Indag. Mathem. 20, 631–640 (2011)

    Article  MathSciNet  Google Scholar 

  3. Cochrane, T.: On a trigonometric inequality of Vinogradov. J. Number Theory 27, 9–16 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cusick, T.W., Ding, C., Renvall, A.: Stream ciphers and number theory. North-Holland Mathematical Library, vol. 66. Elsevier Science B.V., Amsterdam (2004)

    MATH  Google Scholar 

  5. Ding, C., Helleseth, T.: On cyclotomic generator of order r. Information Processing Letters 66, 21–25 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Green, D.H., Green, P.R.: Polyphase power residue sequences. Proc. Royal Society London Pt. A 459, 817–827 (2003)

    Article  MATH  Google Scholar 

  7. Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences. I. Measure of pseudorandomness, the Legendre symbol. Acta Arith. 82, 365–377 (1997)

    MathSciNet  MATH  Google Scholar 

  8. Mauduit, C., Sárközy, A.: On finite pseudorandom sequences of k symbols. Indag. Math. (N.S.) 13, 89–101 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. CRC Press, Boca Raton (1997); With a foreword by Ronald L. Rivest

    Google Scholar 

  10. Niederreiter, H.: Some computable complexity measures for binary sequences. In: Sequences and their Applications (Singapore, 1998), London. Springer Ser. Discr. Math. Theor. Comput. Sci., pp. 67–78 (1999)

    Google Scholar 

  11. Rueppel, R.A.: Stream ciphers. In: Contemporary Cryptology, pp. 65–134. IEEE, New York (1992)

    Google Scholar 

  12. Sárközy, A.: On finite pseudorandom binary sequences and their applications in cryptography. Tatra Mt. Math. Publ. 37, 123–136 (2007)

    MathSciNet  MATH  Google Scholar 

  13. Schmidt, W.M.: Equations over finite fields. An elementary approach. Lecture Notes in Mathematics, vol. 536. Springer, Berlin (1976)

    MATH  Google Scholar 

  14. Sidel’nikov, V.M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Problemy Peredači Informacii 5, 16–22 (1969)

    MathSciNet  MATH  Google Scholar 

  15. Su, M., Winterhof, A.: Autocorrelation of Legendre-Sidelnikov Sequences. IEEE Trans. Inf. Theory 56, 1714–1718 (2010)

    Article  MathSciNet  Google Scholar 

  16. Su, M., Winterhof, A.: Correlation measure of order k and linear complexity profile of legendre-sidelnikov sequences. In: Fifth International Workshop on Signal Design and its Applications in Communications, IWSDA 2011, Guilin, China (October 2011)

    Google Scholar 

  17. Topuzoğlu, A., Winterhof, A.: Pseudorandom sequences. In: Topics in Geometry, Coding Theory and Cryptography. Algebr. Appl., vol. 6, pp. 135–166. Springer, Dordrecht (2007)

    Chapter  Google Scholar 

  18. Winterhof, A.: Linear complexity and related complexity measures. In: Selected Topics in Information and Coding Theory, pp. 3–40. World Scientific, Singapore (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Nankai University, Tianjin, China

    Ming Su

Authors
  1. Ming Su
    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, P.O. Box 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. Department of Mathematics, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby, BC, Canada

    Jonathan Jedwab

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Su, M. (2012). On the d-ary Generalized Legendre-Sidelnikov Sequence. In: Helleseth, T., Jedwab, J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30615-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30615-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30614-3

  • Online ISBN: 978-3-642-30615-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation