Skip to main content
Log in

Correlation of the two-prime Sidel’nikov sequence

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Motivated by the concepts of Sidel’nikov sequences and two-prime generator (or Jacobi sequences) we introduce and analyze some new binary sequences called two-prime Sidel’nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4 we show that these sequences are balanced. In the general case, besides balancedness we also study the autocorrelation, the correlation measure of order k and the linear complexity profile of these sequences showing that they have many nice pseudorandom features.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi sums. Canadian Mathematical Society Series of Monographs and Advanced Texts. A Wiley-Interscience Publication. Wiley, New York (1998).

  2. Brandstätter N., Winterhof A.: Some notes on the two-prime generator of order 2. IEEE Trans. Inform. Theory 51(10), 3654–3657 (2005)

    Article  MathSciNet  Google Scholar 

  3. Burde K.: Über allgemeine Sequenzen der Länge 3 von Legendresymbolen. (German) J. Reine Angew. Math. 272, 203–216 (1974)

    MathSciNet  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).

  5. Jungnickel D.: Finite fields. Structure and arithmetics. Bibliographisches Institut, Mannheim (1993)

    MATH  Google Scholar 

  6. Lidl R., Niederreiter H.: Finite fields. Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1997)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  8. Sidel’nikov V. M.: Some k-valued pseudo-random sequences and nearly equidistant codes. Probl. Inf. Transm. 5, 12–16 (1969) (translated from Problemy Peredači Informacii 5, 16–22 (1969) (Russian)).

    Google Scholar 

  9. Su M., Winterhof A.: Autocorrelation of Legendre-Sidel’nikov sequences. IEEE Trans. Inform. Theory 56(4), 1714–1718 (2010)

    Article  MathSciNet  Google Scholar 

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

  11. Winterhof A.: Linear complexity and related complexity measures. In: Woungang, I. et al. (eds) Selected Topics in Information and Coding Theory, World Scientific, Singapore (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arne Winterhof.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Brandstätter, N., Pirsic, G. & Winterhof, A. Correlation of the two-prime Sidel’nikov sequence. Des. Codes Cryptogr. 59, 59–68 (2011). https://doi.org/10.1007/s10623-010-9467-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-010-9467-8

Keywords

Mathematics Subject Classification (2000)

Navigation