一类广义自缩序列的伪随机性  

Pseudo-randomness of a class of generalized self-shrinking sequences

作　　者：徐林[1] 孙国华[2] 

机构地区：[1]马钢车轮公司信息中心,安徽马鞍山243000 [2]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《合肥工业大学学报（自然科学版）》2010年第9期1346-1350,共5页Journal of Hefei University of Technology：Natural Science

基　　金：安徽省教育厅自然科学基金资助项目(KJ2009A132)

摘　　要：在序列密码中,加密和解密所用的密钥序列都是伪随机序列。序列密码体制的安全强度取决于密钥流,因而伪随机序列生成器的设计与分析一直是序列密码研究的中心课题。文章利用计算机编程计算,对大量的比特串进行分析,通过选择适当的比特串101、1011、1101、11100、111010和111011,分析其出现次数的奇偶性,证明了广义自缩序列b(ak+1+ak+2)的最小周期在所有1 024种情形下全部达到最大,即2n-1;同时证明了该序列具有良好的低阶自相关性。In stream cipher,the key sequence used in both encryption and decipher is the pseudorandom sequence.The safety intensity of the stream cipher is decided by the key sequence,so the design and analysis of the pseudorandom sequence generators are always the central task of the research on stream cipher.With computer programming,certain groups of bit string are obtained by analyzing the parity of appearing times of some relevant strings such as 101,1011,1101,11100,111010,111011 in generalized self-shrinking sequence b（ak＋1＋ak＋2）.It is proved that the least period reaches the maximum,namely 2n-1,in 1 024 cases.And the sequence has a good low degree auto-correlation.

关 键 词：序列密码 M-序列 广义自缩序列 最小周期 低阶相关性 

分 类 号：TN918.1[电子电信—通信与信息系统]