几类具有交织级联结构的伪随机序列的线性复杂度  

The linear complexity of several classes of pseudo-random sequences with interleaving cascade structure

作　　者：王艳[1] 胡声 韩西林 李顺波[1] WANG Yan;HU Sheng;HAN Xilin;LI Shunbo(School of Science,Xi′an University of architecture and technology,Xi′an 710055,China)

机构地区：[1]西安建筑科技大学理学院,陕西西安710055

出　　处：《纯粹数学与应用数学》2024年第3期435-449,共15页Pure and Applied Mathematics

基　　金：国家自然科学基金(61902304);西安建筑科技大学自然科学专项(ZR19052).

摘　　要：为构造用于流密码的新的密钥流生成器,本文研究了结合交织和级联技术的伪随机序列的生成.通过计算多项式零点的个数,在特征为2的有限域上,获得了由Legendre序列和Hall序列构造的二元交织序列的线性复杂度.结果表明这些序列的线性复杂度大于其周期的一半,可抵抗Berlekamp-Massey(B-M)算法的攻击.To construct a new keystream generator for stream cipher,the generation of pseudo-random sequences combining interleaving and cascading technology is studied.By calculating the number of polynomial zeros,the linear complexity of binary interleaved sequences constructed by Legendre sequences and Hall sequences over nite elds with characteristic 2 is obtained.The results show that the linear complexity of these sequences is larger than half of their period,which means such sequences can resist the attack of the Berlekamp-Massey(B-M)algorithm.

关 键 词：流密码 安全性分析 交织序列 线性复杂度 高斯周期 

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