SLCE序列的2-adic复杂度  

2-adic complexity of SLCE sequence

作　　者：王艳[1] 李顺波[1] 薛改娜 WANG Yan;LI Shunbo;XUE Gaina(School of Science,Xi’an University of Architecture and Technology,Xi’an 710055,China)

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

出　　处：《通信学报》2019年第8期151-156,共6页Journal on Communications

基　　金：西安建筑科技大学自然科学专项基金资助项目(No.1609718034);西安建筑科技大学校人才基金资助项目(No.RC1221);国家自然科学基金资助项目(No.11471255)

摘　　要：针对SLCE序列的2-adic复杂度,首先利用分圆数获得此类序列的自相关函数值,根据2-adic复杂度与自相关函数的关系分析了序列2-adic复杂度取值特点,结合SLCE序列的自相关函数值与周期的最大公因子,给出了一个SLCE序列2-adic复杂度达到最大值的条件。结果表明很多有限域上的SLCE序列的2-adic复杂度可达到最大值。Aiming at the 2-adic complexity of Sidelnikov-Lempel-Cohn-Eastman sequences,autocorrelation function value of this kind of sequence was obtained by using the cyclotomic number.Based on the relationship between 2-adic complexity and autocorrelation function,properties of 2-adic complexity value were analyzed.According to the greatest common divisor between the autocorrelation function value and the period of SLCE sequence,the condition that the 2-adic complexity of a SLCE sequence reaches its maximum value was given.The results show that 2-adic complexity of SLCE sequence on many finite field can reach the maximum value.

关 键 词：序列密码 Sidelnikov-Lempel-Cohn-Eastman序列 2-adic复杂度 自相关性 

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