Skip to main content
SpringerLink
Log in

Lower bounds on the weight complexities of cascaded binary sequences

  • Section 2 Pseudorandomness And Sequences I
  • Conference paper
  • First Online:
Advances in Cryptology — AUSCRYPT '90 (AUSCRYPT 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 453))

Included in the following conference series:

Abstract

The stability of linear complexity of sequences is a basic index for measuring the quality of the sequence when employed as a key stream of a stream cipher. Weight complexity is such a quantity which can be used to measure the stability of a sequence. Lower bounds on the weight complexities of a kind of cascaded binary sequences are presented in this correspondence.

This work is one part of the research of the Stability of Stream Ciphers supported by the Chinese Natural Science Foundation under No.6882007.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Beth and F.C. Piper, ‘The Stop-and-Go Generator', Advances in Cryptology, Lecture Notes in Computer Science, Vol.209, pp.88–92.

    Google Scholar 

  2. Kjeldsen Andresen, 'some Randomness Properties of Cascaded Sequences,’ IEEE Infor. Th. Vol IT-26 No.2, 1980.

    Google Scholar 

  3. Rainer Vogel, ‘On the Linear Complexity of Cascaded Sequences', Advances in Cryptology — Proceedings of Eurocrypt'84, Lecture Notes in Computer Science, Vol.209, pp.99–109.

    Google Scholar 

  4. Dieter Gollmann, ‘Pseudo Random Properties of Cascaded Connections of Clock Controlled Shift Registers', Advances in Cryptology, Lecture Notes in Computer Science, Vol.209, pp.93–98.

    Google Scholar 

  5. C.G. Gunther, ‘A generator of pseudorandom sequences with clock controlled linear feedback shift registers', Presented at Eurocrypt 87, Amsterdam, Netherlands.

    Google Scholar 

  6. Rainer A. Rueppel, ‘When Shift Registers Clock Themselves', Presented at Eurocrypt 87, Amsterdam, Netherlands.

    Google Scholar 

  7. Cunsheng Ding, Guozhen Xiao and Weijuan Shan, ‘New Measure Index on the Security of Stream Ciphers', Northwest Telecommunication Engineering Institute, Xian, China.

    Google Scholar 

  8. Cunsheng Ding, ‘Weight Complexity and Lower Bounds for the Weight Complexities of Binary Sequences with Period 2’ Unpublished.

    Google Scholar 

  9. E.R. Berlekamp, ‘Algebraic Coding Theory', McGraw-Hill, New York, 1968.

    Google Scholar 

  10. Rudolf Lidl, ‘Finite Fields', Encycolpedia of Mathematics and Applications, Vol.20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Northwest Telecommunication Engineering Institute, Xian, China

    Cunsheng Ding

Authors
  1. Cunsheng Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jennifer Seberry Josef Pieprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ding, C. (1990). Lower bounds on the weight complexities of cascaded binary sequences. In: Seberry, J., Pieprzyk, J. (eds) Advances in Cryptology — AUSCRYPT '90. AUSCRYPT 1990. Lecture Notes in Computer Science, vol 453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030350

Download citation

  • DOI: https://doi.org/10.1007/BFb0030350

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53000-8

  • Online ISBN: 978-3-540-46297-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation