On the Linear Complexity of Products of Shift-Register Sequences. - Rainer Göttfert; Harald Niederreiter (EUROCRYPT, 1993)

Factorization of Polynomials over Finite Fields and Characteristic Sequences. - Harald Niederreiter; Rainer Göttfert (J. Symb. Comput., 1993)

General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences. - Rainer Göttfert; Harald Niederreiter (EUROCRYPT, 1994)

Linear Filtering of Nonlinear Shift-Register Sequences. - Berndt M. Gammel; Rainer Göttfert (WCC, 2005)

An NLFSR-based stream cipher. - Berndt M. Gammel; Rainer Göttfert; O. Kniffler (ISCAS, 2006)

Sequences of Period 2N-2. - Rainer Göttfert (SETA, 2006)

On the frame length of Achterbahn-128/80. - Rainer Göttfert; Berndt M. Gammel (ITW, 2007)

A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack. - Rainer Göttfert (Applied Algebra and Number Theory, 2014)