On the general classification of nonlinear filters of m-sequences

Information Processing Letters

Volumn 69, Issue 5, 1999, Pages 227-232

  Garcia Villalba L J ^a   Fuster Sabater A ^a  

^a Consejo Superior de Investigaciones Científicas   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; RANDOM PROCESSES;

PSEUDORANDOM SEQUENCES; SEQUENTIAL DECOMPOSITION;

NONLINEAR FILTERING;

EID: 0033548341     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00021-6     Document Type: Article

References (5)

1. [1] A. Fúster-Sabater, L.J. García-Villalba, On the structural properties of the nonlinear filterings of m-sequences, in: Proc. 1998 IEEE International Symposium on Information Theory, MIT, Cambridge, MA, 1988, p. 104.
2. [2] S.W. Golomb, Shift Register-Sequences, Aegean Park Press, CA, 1982.
3. [3] E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Trans. Inform. Theory IT-22 (6) (1976) 732-736.
4. [4] R. Lidl, H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge, 1986.
5. [5] R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer, New York, 1986.