The Shortest Feedback Shift Register That Can Generate A Given Sequence
In this paper the problem of finding the absolutely shortest (possibly nonlin- ear) feedback shift register, which can generate a given sequence with characters from some arbitrary finite alphabet, is considered. To this end, a new complex- ity measure is defined, called the maximum order complexity. A new theory of the nonlinear feedback shift register is developed, concerning elementary complexity properties of transposed and reciprocal sequences, and feedback functions of the maximum order feedback shift register equivalent. Moreover, Blumer’s algorithm is identified as a powerful tool for determining the maxi- mum order complexity profile of sequences, as well as their period, in linear time and memory. The typical behaviour of the maximum order complexity profile is shown and the consequences for the analysis of given sequences and the synthesis of feedback shift registers are discussed.
- A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell. “Linear Size Finite Automata for the Set of all Subwords of a Word: An Outline of Results”, Bul. Eur. Assoc. Theor. Comp. Sci., no. 21, pp. 12–20, 1983.Google Scholar
- D. W. Davies and W. L. Price. Security for Computer Networks, John Wiley & Sons, Inc., Chichester, 1984.Google Scholar
- C. J. A. Jansen. Investigations On Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD. Thesis, Technical University of Delft, Delft, 1989.Google Scholar
- F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes, Amsterdam, North-Holland, 1978.Google Scholar
- J. L. Massey. “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. on Info. Theory, vol. IT-15, January 1969.Google Scholar
- R. A. Rueppel. New Approaches to Stream Ciphers, PhD. Thesis, Swiss Federal Institute of Technology, Zurich, 1984.Google Scholar