一种基于m-序列的逆矩阵置换生产方法

A Produced Method of Inverse Matrix Permutation Based on m-sequences

在序列密码中,输出序列的线性复杂度是一种非常重要的特征性质,因为已知的Berlekamp-massey算法对滚动密钥生成器是一种有效而且威胁极大的攻击手段,所以在设计滚动密钥序列生成器时必须能产生具有极大线性复杂度的密钥序列,虽然这只是个必要非充分的条件。利用m-序列的良好特性与代数上的逆矩阵理论提出了一种用本原多项式生成的线性反馈移位寄存器序列置换生成的具有良好性质的伪随机序列。新生成的二元序列不但保持了m-序列的良好特性,同时还极大提高了序列的线性复杂度,在一定范围内具有良好实用价值。

The linear complexity of output sequences is a very important characteristic in stream cryptogram because Berlekamp -Massey algorithm is a very resultful and threaten way to maker of cipher key.We must design the maker of cipher key with large linear complexity alo ugh it is not sufficient but necessary condition.We propose a pseudo -ran dom sequences per-muted by m -sequences,which base on g ood property of m -sequences and theory of inverse matrix.This new binary se-quences not only keep good property o f m -sequences but also improve the li near complexity of sequences.There are good appli-cations in some fields.