2~n周期二元序列的伪随机性质研究

Investigation on Pseudorandom Properties of Binary 2~n-periodic Sequence

密码学意义上强的序列不仅应该具有足够高的线性复杂度,而且当少量比特发生变化时不会引起线性复杂度的急剧下降,即具有足够高的k-错线性复杂度。本文研究了一种简单易行的方法计算GF(2)上周期为2n的序列的线性复杂度,给出了k=minerror(Y)时,LCk(Y)的上界,同时,计算了在特殊情况下LCk(Y)的确切表达式。

Not only should cryptographically strong sequences have a large linear complexity ,but also the change of a few terms should not cause a significant decrease in linear complexity .In this paper ,A fast algorithm for determining the complexity of a binary sequence with period 2 n is determined ,and this way is easy to implement; we give the upper bounds of LCk（Y） when k=min error（Y）;In some case , we give the expression of LCk （Y）.