Skip to main content
SpringerLink
Log in

On the linear complexity of nonlinearly filtered PN-sequences

  • Conference paper
  • First Online:
Book cover Advances in Cryptology — ASIACRYPT'94 (ASIACRYPT 1994)

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

Included in the following conference series:

Abstract

A method of analysis for the linear complexity of nonlinearly filtered PN-sequences is presented. The procedure provides a general lower bound for the linear complexity and an algorithm to improve it. The results obtained are valid for any nonlinear function with a unique term of maximum order and for any maximal-length LFSR. This work, which has as starting point “the root presence test” by Rueppel, is based on the handling of binary strings instead of determinants in a finite field.

This work was supported by R&D Spanish Program TIC91-0386.

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. E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. Inform. Theory, vol. IT-17, pp. 288–296, May 1971.

    Google Scholar 

  2. E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Trans. Inform. Theory, vol. IT-22, pp. 732–736, Nov. 1976.

    Google Scholar 

  3. P. V. Kumar and R. A. Scholtz, Bounds on the linear span of bent sequences, IEEE Trans. Inform. Theory, vol. IT-29, pp. 854–862, Nov. 1983.

    Google Scholar 

  4. J.L. Massey, Shift-Register synthesis and BCH decoding, IEEE Trans. Inform. Theory, vol. IT-15, Jan. 1969.

    Google Scholar 

  5. J.L. Massey, Seminar Cryptography: Fundamentals and applications, Zurich, 1990.

    Google Scholar 

  6. W.W. Peterson and E.J. Weldon, Error-Correcting Codes, Cambridge, MA: MIT Press, 1972.

    Google Scholar 

  7. R.A Rueppel, Analysis and design of stream ciphers, Springer-Verlag, New York, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Cryptography, Institute of Electronics of Communications (CSIC), Serrano 144, 28006, Madrid, Spain

    Amparo Fúster-Sabater

  2. Department of Statistics, Operations Research and Computation, Faculty of Maths, University of La Laguna, 38271, La Laguna, Spain

    Pino Caballero-Gil

Authors
  1. Amparo Fúster-Sabater
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pino Caballero-Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josef Pieprzyk Reihanah Safavi-Naini

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fúster-Sabater, A., Caballero-Gil, P. (1995). On the linear complexity of nonlinearly filtered PN-sequences. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000426

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59339-3

  • Online ISBN: 978-3-540-49236-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation