Advertisement

Lower Bounds for the Linear Complexity of Sequences over Residue Rings

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 473)

Abstract

Linear feedback shift registers over the ring Z 2 e can be implemented efficiently on standard microprocessors. The most significant bits of the elements of a sequence in Z 2 e∞ constitute a binary pseudo-random sequence. We derive lower bounds for the linear complexity over F 2 of these binary sequences.

References

  1. [1]
    Z.D. Dai, The Binary Sequences Derived from the Sequences over the Integral Residue Ring Z/(2e). I, Internal Report, Academia Sinica, Beijing, ChinaGoogle Scholar
  2. [2]
    Z.D. Dai, D. Gollmann Lower Bounds for the Linear Complexity of Sequences over Residue Rings, E.I.S.S. Report, No. 90/7, 1990Google Scholar
  3. [3]
    A.M. Frieze, J. Hastad, R. Kannan, J.C. Lagarias, A. Shamir, Reconstructing Truncated Integer Variables Satisfying Linear Congruences, SIAM J. Comput., Vol.17, No.2, pp.262–280, April 1988MathSciNetzbMATHCrossRefGoogle Scholar
  4. [4]
    M.Q. Huang, The Binary Sequences Derived from the Sequences over the Integral Residue Ring Z/(2e). II, Internal Report, Academia Sinica, Beijing, ChinaGoogle Scholar
  5. [5]
    W. Peterson, E. Weldon, Error Correcting Codes, 2nd ed., M.I.T.Press, Cambridge, Berlin, 1986Google Scholar
  6. [6]
    R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer, Cambridge, Mass., 1972Google Scholar
  7. [7]
    M. Ward, The arithmetical theory of linear recurring sequences, Transactions of the American Mathematical Society, Vol.35, pp.600–628, July 1933MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.University of LinköpingSweden
  2. 2.E.I.S.S., University of KarlsruheGermany

Personalised recommendations