Advertisement

On Functions of Linear Shift Register Sequences

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

Abstract

This paper is intended as an overview, presenting several results on the linear complexity of sequences obtained from functions applied to linear shift register sequences. Especially for cryptologic applications it is of course highly desirable that the linear complexity be as large as possible, and not only to get a huge period. The theory reviewed in this paper contains several criteria on how to achieve such goals.

Keywords

Linear Complexity Shift Register Hadamard Product Feedback Coefficient Partial Fraction Expansion 
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.

Some Selected References (in chronological order)

  1. L. Fibonacci, Liber Abaci, 1202Google Scholar
  2. E. Galois, “Sur la theorie des nombres”, Bull. Sci. Math. de M. Ferussac, 1830; J. Math. Pures Appl., 1846Google Scholar
  3. L. Kronecker, Werke Bd. 2, pp. 146–149, 1881Google Scholar
  4. D. E. Müller, “Application of Boolean Algebra to Switching Circuit Design and to Error Detection”, IRE Trans. on Electron, Comp., 1954Google Scholar
  5. I. S, Reed, “A Class of Error Correcting Codes and the Decoding Scheme”, IRE Trans. on Electron. Comp., 1954Google Scholar
  6. N. Zierler, “Linear Recurring Sequences”, J. SIAM, 1959; also in W. H. Kautz, Linear Sequential Switching Circuits, Holden-Day, San Francisco, 1965Google Scholar
  7. E. S. Selmer, Linear Recurrence Relations over Finite Fields, Univ. of Bergen, Norway, 1966Google Scholar
  8. B. L. van der Waerden, Algebra I, Springer, Berlin, 1966Google Scholar
  9. S. W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, 1967zbMATHGoogle Scholar
  10. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York. 1968zbMATHGoogle Scholar
  11. J. L. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Trans on Inform. Th., 1969Google Scholar
  12. E. J. Groth, “Generation of Binary Sequences with Controllable Complexity”, IEEE Trans. on Inform. Th., 1971Google Scholar
  13. N. Zierler and W. H. Mills, “Products of Linear Recurring Sequences”, J. Algebra, 1973Google Scholar
  14. M. P. Ristenbatt et al., “Crack-Resistant Sequences for Data Security”, IEEE Nat. Telecomm. Conf., 1973Google Scholar
  15. P. R. Geffe, “How to Protect Data with Ciphers That Are Really Hard to Break”, Electronics, 1973Google Scholar
  16. P. Nyffeler, Binäre Automaten und ihren linearen Rekursionen, Ph.D. Thesis, Bern, 1975Google Scholar
  17. B. Benjauthrit and I. S. Reed, “Galois Switching Functions and Their Applications”, IEEE Trans. on Comp., 1976Google Scholar
  18. E. L. Key, “An Analysis of the Structure and Complexity of Nonlinear Binary Sequences Generators”, IEEE Trans. on Inform. Th., 1976Google Scholar
  19. K. P. Yiu and R. B. Ward, “A Method for Deciphering a Maximal-Length Sequence”, Proc. IEEE, 1977Google Scholar
  20. T. Herlestam, “On Linearization of Nonlinear Combinations of Linear Shift Register Sequences”, IEEE ISIT, Ithaca, New York, 1977Google Scholar
  21. H. Lüneburg, Galoisfelder, Kreisteilungskörper und Schieberegisterfolgen, Bibliogr. Inst., Zürich, 1979zbMATHGoogle Scholar
  22. A. Tucker, Applied Combinatorics, Wiley, New York, 1980zbMATHGoogle Scholar
  23. S. M. Jennings, A Special Class of Binary Sequences, Ph.D. Thesis, London, 1980Google Scholar
  24. T. Herlestam, “On Using Prime Polynomials in Crypto Generators”, in Cryptography, Proc. Burg Feuerstein, 1982, ed. by T. Beth, Springer, Berlin, 1983Google Scholar
  25. T. Herlestam, “On the Complexity of Functions of Linear Shift Register Sequences”, IEEE ISIT, Les Arcs, France, 1982Google Scholar
  26. H. Beker and F. Piper, Cipher Systems, Northwood Publ., London, 1982zbMATHGoogle Scholar
  27. R. Lidl and H. Niederreiter, Finite Fields, Encycl. Math. and Its Appl. Vol. 20, Addison-Wesley, 1983Google Scholar
  28. T. Herlestam, “On the Complexity of Certain Crypto Generators”, in security, IFIP/sec’83, ed. by V. Fåk, North-Holland, 1983Google Scholar
  29. R. Rueppel, New Approaches to Stream Ciphers, Ph.D. Thesis, Zürich, 1984Google Scholar
  30. L. Brynielsson, “On the Linear Complexity of Combined Shift Register Sequences”, Eurocrypt 85, Linz, Austria, 1985Google Scholar

Copyright information

© Spnnger-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Dept. of Computer EngineeringUniversity of LundLundSweden
  2. 2.Dept. of Signal SecurityGeneral Staff of DefenseHelsingborgSweden

Personalised recommendations