摘要: 周期序列的线性复杂度是衡量流密码系统安全性能的一个重要指标。近几年人们注重对多重周期序列的联合线性复杂度的研究。该文给出了Fp上周期为Pn的多重周期序列联合线性复杂度的一个新的表达式,介绍了周期为Pn的随机多重周期序列联合线性复杂度分布的计算方法,提出了一种周期为Pn的多重周期序列联合线性复杂度的快速算法。
关键词:
流密码系统,
周期序列,
线性复杂度,
联合线性复杂度,
快速算法
Abstract: 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 Pn-periodic sequences over Fp. A new fast algorithm for computing the joint linear complexity of Pn-periodic sequences over Fp is proposed.
Key words:
Stream cipher system,
Periodic sequence,
Linear complexity,
Joint linear complexity,
Fast algorithm
中图分类号:
苏 明;吴功宜. 多重周期序列联合线性复杂度及其快速算法[J]. 计算机工程, 2007, 33(09): 4-6.
SU Ming; WU Gongyi. Joint Linear Complexity and Its Fast Algorithm of Multi-periodic Sequence[J]. Computer Engineering, 2007, 33(09): 4-6.