ACHTERBAHN-128/80

[1]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[2]  Palash Sarkar,et al.  Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality , 1999, CRYPTO.

[3]  Oliver Kniffler,et al.  Improved Boolean Combining Functions for Achterbahn , 2005 .

[4]  Willi Meier,et al.  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback , 2003, CRYPTO.

[5]  Dan Laksov.  Linear Recurring Sequences over Finite Fields. , 1965 .

[6]  Elbert A. Walker,et al.  Non-Linear Recursive Sequences , 1959, Canadian Journal of Mathematics.

[7]  Willi Meier,et al.  Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.

[8]  Simon R. Blackburn,et al.  A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence , 1994, IEEE Trans. Inf. Theory.

[9]  Rainer Göttfert,et al.  Linear Filtering of Nonlinear Shift-Register Sequences , 2005, WCC.

[10]  B. M. Fulk.  MATH , 1992 .

[11]  Neal Zierler,et al.  Products of linear recurring sequences , 1973 .

[12]  C.J.A. Jansen,et al.  Investigations on nonlinear streamcipher systems: construction and evaluation methods , 1989 .

[13]  Claude Carlet,et al.  Algebraic Attacks and Decomposition of Boolean Functions , 2004, EUROCRYPT.

[14]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[15]  Zongduo Dai,et al.  Linear Complexity of Periodically Repeated Random Sequences , 1991, EUROCRYPT.

[16]  Jovan Dj. Golic,et al.  On the linear complexity of functions of periodic GF(q) sequences , 1989, IEEE Trans. Inf. Theory.

[17]  Martin Hell,et al.  Cryptanalysis of Achterbahn-Version 2 , 2006, Selected Areas in Cryptography.

[18]  Tore Herlestam,et al.  On Functions of Linear Shift Register Sequences , 1985, EUROCRYPT.

[19]  Thomas W. Cusick.  On Constructing Balanced Correlation Immune Functions , 1998, SETA.

[20]  Willi Meier,et al.  Cryptanalysis of Achterbahn , 2006, FSE.

[21]  Rainer A. Rueppel,et al.  Products of linear recurring sequences with maximum complexity , 1987, IEEE Trans. Inf. Theory.

[22]  Robert J. McEliece.  Linear Recurring Sequences Over Finite Fields , 1967 .

[23]  Yuriy Tarannikov,et al.  On Resilient Boolean Functions with Maximal Possible Nonlinearity , 2000, INDOCRYPT.

[24]  Thomas Siegenthaler,et al.  Correlation-immunity of nonlinear combining functions for cryptographic applications , 1984, IEEE Trans. Inf. Theory.

[25]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[26]  Harald Niederreiter,et al.  Sequences With Almost Perfect Linear Complexity Profile , 1987, EUROCRYPT.

[27]  Cunsheng Ding,et al.  Sequences and their Applications: Proceedings Of Seta '98 , 1999 .

[28]  Nicolas Courtois.  Fast Algebraic Attacks on Stream Ciphers with Linear Feedback , 2003, CRYPTO.

[29]  N. Courtois,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.