Advertisement

d-Functions in Vk(F2) and self-decimation of m-sequences

  • Kencheng Zeng
  • Dah-Yea Wei
  • T. R. N. Rao
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 539)

Abstract

With the purpose of generating, by the help of a single clock-controlled LFSR, a large class of binary sequences strong enough for cryptographic application, an extension class of key-specifiable transfer functions is proposed and analyzed. When tapped as feedforward networks to the LFSR under consideration, these functions will control the stepping of the latter in such a way that its output signals will be decimated pseudo-randomly at a pre-assigned rate. The decimation rate and the length of the LFSR are then suitably selected so that the resulting sequence will have, among others, a large prime period and a linear complexity comparable in order of magnitude to the period. Some conclusions concerning the average and maximal implementable decimation rates are also given.

Keywords

Binary Sequence Linear Complexity Output Sequence Delay Element Prime Period 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R.A. Rueppel, When Shift Registers Clock Themselves, Proc. Eurocrypt'87, Springer-Verlag Lecture Notes in Computer Science, No. 304, 1987.Google Scholar
  2. [2]
    W.G. Chambers and D. Gollmann, Generators for Sequences with Near-Maximal Linear Equivalence, IEE Proceedings, Vol. 135, Pt. E., No. 1, Jan. 1988.Google Scholar
  3. [3]
    S. Golomb, Shift Register Sequences, Holden-Day, New York, 1967.Google Scholar
  4. [4]
    G. Polya and G. Szegö, Aufgaben und Lehrsäze aus der Analys, Dover Publication, New York, 1945.Google Scholar
  5. [5]
    H. Riesel, Prime Numbers and Computer Methods for Factorizations, Birkhäuser, Boston, Inc., 1985.Google Scholar
  6. [6]
    K.C. Zeng, C.H. Yang and T.R.N. Rao, Large Primes in Stream Cipher Cryptography, Proc. of Auscrypt'90, Springer-Verlag Lecture Notes in Computer Science, No. 453, New York.Google Scholar
  7. [7]
    K.C. Zeng, C.H. Yang and T.R.N. Rao, An Improved Linear Syndrome Algorithm in Cryptanalysis with Applications, to appear in Proc. of Crypto'90, Springer-Verlag Lecture Notes in Computer Science.Google Scholar
  8. [8]
    Don Coppersmith, Fast Evaluation of Logarithms in Fields of Characteristic of Two, IEEE Trans. Information Theory, IT-30, July 1984, pp. 587–594.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Kencheng Zeng
    • 1
  • Dah-Yea Wei
    • 2
  • T. R. N. Rao
    • 2
  1. 1.Graduate School of USTC, Academia SinicaBeijingPeople's Republic of China
  2. 2.The Center for Advanced Computer StudiesUniversity of Southwestern LouisianaLafayette

Personalised recommendations