On the k-error linear complexity of 2p~2-periodic binary sequences

作     者：Zhihua NIU Can YUAN Zhixiong CHEN Xiaoni DU Tao ZHANG Zhihua NIU;Can YUAN;Zhixiong CHEN;Xiaoni DU;Tao ZHANG

作者机构：School of Computer Engineering and Science Shanghai University College of Mathematics and Statistics Northwest Normal University Provincial Key Laboratory of Applied Mathematics Putian University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2020年第63卷第9期

页      面：263-276页

核心收录：

学科分类：0808[工学-电气工程] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：partially supported by State Key Program of National Nature Science Foundation of China (Grant No. 61936001) National Nature Science Foundation of Shanghai (Grant Nos. 16ZR1411200,17ZR1409800,19ZR1417700) Research and Development Program in Key Areas of Guangdong Province (Grant No.2018B010113001) National Nature Science Foundation of China (Grant No. 61572309) partially supported by National Natural Science Foundation of China (Grant No. 61772292) partially supported by National Natural Science Foundation of China (Grant No.61772022) Projects of International Cooperation and Exchanges NSFC-RFBR (Grant No. 61911530130) 

摘      要：Dear editor,Pseudorandom sequences play an important role in cryptography. In particular in symmetric cryptography they serve as the secret key. So the designs of pseudorandom sequences and cryptographic indicators are the critical research directions. The