Advertisement

Linear Span analysis of a set of periodic sequence generators

  • P. Caballero-Gil
  • A. Fúster-Sabater
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)

Abstract

An algorithm for computing lower bounds on the global linear complexity of nonlinearly filtered PN-sequences is presented. Unlike the existing methods, the algorithm here presented is based on the realization of bit wise logic operations. The numerical results obtained are valid for any nonlinear function with a unique term of maximum order and for any maximal-length LFSR. To illustrate the power of this technique, we give some high lower bounds that confirm Rueppel's conclusion about the exponential growth of the linear complexity in filter generators.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Fúster-Sabater and P. Caballero-Gil, ‘On the Linear Complexity of Nonlinearly Filtered PN-Sequences', Advances in Cryptology-ASIACRYPT'94, Lecture Notes in Computer Science Vol. 917, Springer-Verlag.Google Scholar
  2. 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.CrossRefGoogle Scholar
  3. 3.
    D.E. Knuth, ‘The Art of Computer Programming, Vol. 2: Seminumerical Algorithms', Addison-Wesley, 1981.Google Scholar
  4. 4.
    P.V. Kumar and R.A. Scholtz, ‘Bounds on the Linear Span of Bent Sequences', IEEE Transactions on Information Theory, Vol. IT-29, pp. 854–862, Nov. 1983.CrossRefGoogle Scholar
  5. 5.
    J.L. Massey, ‘Shift-Register Synthesis and BCH Decoding', IEEE Transactions on Information Theory, Vol. IT-15, pp. 122–127, Jan. 1969.CrossRefGoogle Scholar
  6. 6.
    J.L. Massey and S. Serconek, ‘A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences', Advances in Cryptology-CRYPTO'94, Lecture Notes in Computer Science Vol. 839, pp. 332–340, Springer-Verlag, 1994.Google Scholar
  7. 7.
    K.G. Paterson, ‘New Lower Bounds on the Linear Complexity of Nonlinearly Filtered m-Sequences', submitted to IEEE Transactions on Information Theory, 1995.Google Scholar
  8. 8.
    R.A. Rueppel, ‘Analysis and Design of Stream Ciphers', Springer-Verlag, New York, 1986.Google Scholar
  9. 9.
    G.J. Simmons (ed.), ‘Contemporary Cryptology: The Science of Information Integrity', IEEE Press, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • P. Caballero-Gil
    • 1
  • A. Fúster-Sabater
    • 2
  1. 1.Department of Statistics, Operations Research and Computation, Facility of MathsUniversity of La LagunaLa LagunaSpain
  2. 2.Laboratory of Cryptography, Department of Information Theory and CodingInstitute of Electronics of Communications (CSIC)MadridSpain

Personalised recommendations