剩余类环上LFSR序列乘积的线性复杂度
, PP. 1-4
Keywords: 线性复杂度,极大长序列,算述结果
Abstract:
证明了剩余类环上LFSR序列乘积的线性复杂度小于线性复杂度的积.特别地,具有互素本原多项式的极大长序列乘积的线性复杂度等于线性复杂度的乘积.
| [1] | Rainer A.Rueppel.Analysis and design of stream cipher[M].Spring Verlag Berlin,Heidelberg 1986.
|
| [2] | Brown W C.Matrices over commutative rings[M].Marcel Dekker Inc,1993.
|
Full-Text
