Title of article
New upper bounds on the linear complexity
Author/Authors
P. Caballero-Gil، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2000
Pages
8
From page
31
To page
38
Abstract
In this work, the general upper bound on the linear complexity given by Key is improved for certain families of nonlinear filter functions. Also, a new class of cyclotomic cosets whose degeneration is relatively easy to prove in several conditions is introduced and analysed.
Keywords
Linear complexity , Cyclotomic coset , Cryptography , Key stream generator , Nonlinear filter function
Journal title
Computers and Mathematics with Applications
Serial Year
2000
Journal title
Computers and Mathematics with Applications
Record number
918637
Link To Document