多重周期序列联合线性复杂度及其快速算法  

Joint Linear Complexity and Its Fast Algorithm of Multi-periodic Sequence

作　　者：苏明[1] 吴功宜[1] 

机构地区：[1]南开大学信息技术科学学院,天津300071

出　　处：《计算机工程》2007年第9期4-6,共3页Computer Engineering

摘　　要：周期序列的线性复杂度是衡量流密码系统安全性能的一个重要指标。近几年人们注重对多重周期序列的联合线性复杂度的研究。该文给出了Fp上周期为Pn的多重周期序列联合线性复杂度的一个新的表达式,介绍了周期为Pn的随机多重周期序列联合线性复杂度分布的计算方法,提出了一种周期为Pn的多重周期序列联合线性复杂度的快速算法。The linear complexity of periodic sequences is one of the important security indices of stream cipher systems. Recently developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the joint linear complexity of multi-sequences. This paper gives a new calculation method to compute the joint linear complexity of random P^n-periodic sequences over Fp. A new fast algorithm for computing the joint linear complexity of P^n-periodic sequences over Fp is proposed.

关 键 词：流密码系统 周期序列 线性复杂度 联合线性复杂度 快速算法 

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