New upper bounds on the linear complexity

Computers and Mathematics with Applications

Volumn 39, Issue 3-4, 2000, Pages 31-38

  Caballero Gil, P ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CRYPTOGRAPHY; FUNCTIONS; MATHEMATICAL MODELS; NONLINEAR FILTERING; POLYNOMIALS; THEOREM PROVING;

CYCLOTOMIC COSET; KEY STREAM GENERATOR; LINEAR COMPLEXITY; NONLINEAR FILTER FUNCTION;

COMPUTATIONAL COMPLEXITY;

EID: 0034140984     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(99)00331-4     Document Type: Article

References (8)

1. J.L. Massey, Shift register synthesis and BCH decoding, IEEE Transactions on Information Theory IT-15, 122-127 (1969).
2. Z.D. Dai, T. Beth and D. Gollmann, Lower bounds for the linear complexity of sequences over residue rings, In Advances in Cryptology-Eurocrypt '90, Lecture Notes in Computer Science, Volume 473, Springer-Verlag, (1991).
3. A. Fúster-Sabater and P. Caballero-Gil, On the linear complexity of nonlinearly filtered PN-sequences, In Advances in Cryptology-Asiacrypt '94, Lecture Notes in Computer Science, Volume 917, Springer-Verlag, (1995).
4. H. Niederreiter, The linear complexity profile and the jump complexity of keystream sequences, In Advances in Cryptology-Asiacrypt '90, Lecture Notes in Computer Science, Volume 473, Springer-Verlag, (1991).
5. E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generators, IEEE Transactions on Information Theory IT-22, 732-736 (1976).
6. R.A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlag, (1986).
7. S.W. Golomb, Shift Register Sequences, Holden-Day, San Francisco, CA, (1967); Revised edition, Aegean Park Press, Laguna Hills, CA, (1982).
8. C. Ding, G. Xiao and W. Shan, The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science, Volume 561, Springer-Verlag, (1991).