Skip to main content
SpringerLink
Log in

On Some Properties of the Shrinking Generator

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

Abstract

We obtain several results about the output rate and distribution ofzeros and ones of the shrinking generator associated with two linear recurringsequences. These results are based on various bounds on the number of zeros of linearrecurring sequences. Non-linear recurring sequences are considered aswell.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. S. R. Blackburn, The linear complexity of the self-shrinking generator, IEEE Trans. on Inform. Theory, Vol. 45 (1999) pp. 2073–2077.

    Google Scholar 

  2. D. Coppersmith, H. Krawczyk and Y. Mansour, The shrinking generator, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 773 (1994) pp. 22–39.

    Google Scholar 

  3. J. D. Golić and L. O'Connor, Embedding and probabilistic correlation attacks on clock-controlled shift registers, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 950 (1995) pp. 230–243.

    Google Scholar 

  4. R. Lidl and H. Niederreiter, Finite fields, Addison-Wesley, MA (1983).

    Google Scholar 

  5. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publ. Comp. (1977).

  6. W. Meier and O. Staffelbach, The self-shrinking generator, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, 950 (1995) pp. 205–214.

    Google Scholar 

  7. I. E. Shparlinski, On some properties of linear cyclic codes, Problemy Peredachi Inform., Vol. 19, No. 3 (1983) pp. 106–110 (in Russian).

    Google Scholar 

  8. I. E. Shparlinski, On weigth spectra of some codes, Problemy Peredachi Inform., Vol. 22, No. 2 (1986) pp. 43–48 (in Russian).

    Google Scholar 

  9. I. E. Shparlinski, Finite fields: Theory and computation, Kluwer Acad. Publ., Dordrecht, The Netherlands (1999).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia

    Igor Shparlinski

Authors
  1. Igor Shparlinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shparlinski, I. On Some Properties of the Shrinking Generator. Designs, Codes and Cryptography 23, 147–156 (2001). https://doi.org/10.1023/A:1011256430812

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011256430812

Search

Navigation