首页 | 本学科首页   官方微博 | 高级检索  
     

Z4上周期为2p2的四元广义分圆序列的线性复杂度
引用本文:杜小妮,赵丽萍,王莲花.Z4上周期为2p2的四元广义分圆序列的线性复杂度[J].电子与信息学报,2018,40(12):2992-2997.
作者姓名:杜小妮  赵丽萍  王莲花
基金项目:国家自然科学基金(61462077, 61772022),安徽省自然科学基金(1608085MF143),上海市自然科学基金(16ZR1411200)
摘    要:该文根据特征为4的Galois环理论,在Z4上利用广义分圆构造出一类新的周期为2p2(p为奇素数)的四元序列,并且给出了它的线性复杂度。结果表明,该序列具有良好的线性复杂度性质,能够抗击Berlekamp-Massey (B-M)算法的攻击,是密码学意义上性质良好的伪随机序列。

关 键 词:流密码    四元序列    线性复杂度    广义分圆类    Galois  
收稿时间:2018-02-11

Linear Complexity of Quaternary Sequences over Z4 Derived from Generalized Cyclotomic Classes Modulo 2p2
Xiaoni DU,Liping ZHAO,Lianhua WANG.Linear Complexity of Quaternary Sequences over Z4 Derived from Generalized Cyclotomic Classes Modulo 2p2[J].Journal of Electronics & Information Technology,2018,40(12):2992-2997.
Authors:Xiaoni DU  Liping ZHAO  Lianhua WANG
Affiliation:College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, China
Abstract:Based on the theory of Galois rings of characteristic 4, a new class of quaternary sequences with period 2p2 is established over Z4 using generated cyclotomy, where p is an odd prime. The linear complexity of the new sequences is determined. Results show that the sequences have larger linear complexity and resist the attack by Berlekamp-Massey (B-M) algorithm. It is a good sequence from the viewpoint of cryptography.
Keywords:
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号