Abstract:
In the light of the inadequate of the sequence which produced by LFSR, this paper proposes a sequence encryption method based on chaos. A Legendre sequence is used as the parameter sequence and the perturbation sequence. B-M algorithm is used to analyze the linear complexity of the new chaotic sequence. The computer simulation results show that the chaotic sequence has better linear complexity properties than original method. This method is fairly good in security and can be implemented easily in software.
Key words:
chaos sequence,
B-M algorithm,
linear complexity
摘要: 针对传统密码学中由线性移位寄存器生成的序列在统计特性上的不足,提出一种基于混沌的序列密码生成方法,并在有限精度实现时引入Legendre扰动序列使得输出具有良好的统计特性。用B-M算法对其进行线性复杂度分析,并与等效的线性反馈移位寄存器的复杂度进行比较,结果显示该混沌序列具有良好的非线性特性,保密性好且软件实现简单。
关键词:
混沌序列,
B-M算法,
线性复杂度
CLC Number:
ZHAO Geng; WANG Bing; YUAN Yang; WANG Zhi-gang;. Analysis of Linear Complexity for a Kind of Chaotic Sequence[J]. Computer Engineering, 2009, 35(21): 10-12,1.
赵 耿;王 冰;袁 阳;王志刚;. 一类混沌序列线性复杂度的分析[J]. 计算机工程, 2009, 35(21): 10-12,1.