Aspects of Linear Complexity

This paper summarizes the results of four separate research topics related to the generation of binary sequences by linear feedback shift registers for applications in crytographic systems.

[1]  Glyn Carter,et al.  Aspects of local linear complexity , 1989 .

[2]  Kenneth G. Paterson.  Perfect factors in the de Bruijn graph , 1995, Des. Codes Cryptogr..

[3]  M.J.B. Robshaw,et al.  Increasing the rate of output for m sequences , 1991 .

[4]  Kenneth G. Paterson,et al.  Decoding Perfect Maps , 1994, Des. Codes Cryptogr..

[5]  Tuvi Etzion,et al.  Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.

[6]  Tuvi Etzion,et al.  Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

[7]  James L. Massey,et al.  The Characterization of All Binary Sequences with Perfect Linear Complexity Profiles , 1986, EUROCRYPT.

[8]  Dieter Gollmann,et al.  Clock-controlled shift registers: a review , 1989, IEEE J. Sel. Areas Commun..

[9]  Richard A. Games,et al.  On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.

[10]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[11]  Richard A. Games.  There Are No De Bruijn Sequences of Span n with Complexity 2n-1+n+1 , 1983, J. Comb. Theory, Ser. A.

[12]  Simon R. Blackburn.  Increasing the Rate of Output of m-Sequences , 1994, Inf. Process. Lett..

[13]  Abraham Lempel,et al.  On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.

[14]  Harald Niederreiter,et al.  The Probabilistic Theory of Linear Complexity , 1988, EUROCRYPT.

[15]  Richard A. Games,et al.  A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.

[16]  Kenneth G. Paterson.  Perfect maps , 1994, IEEE Trans. Inf. Theory.