Linear Complexity of Least Significant Bit of Polynomial Quotients  

作　　者：ZHAO Chun'e MA Wenping YAN Tongjiang SUN Yuhua 

机构地区：[1]State Key Laboratory of Integrated Service Networks, Xidian University [2]College of Sciences, China University of Petroleum,Qingdao

出　　处：《Chinese Journal of Electronics》2017年第3期573-578,共6页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61170319,No.61072140,No.61373171);the 111 Project(No.B08038);the Specialized Research Fund for the Doctoral Program of Higher Education(No.20100203110003);the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund(Fujian Normal University)(No.15002);the Shandong Provincial Natural Science Foundation of China(No.ZR2014FQ005);the Fundamental Research Funds for the Central Universities(No.15CX08011A,No.15CX02065A,No.15CX02060A,No.15CX05060A,No.16CX02013A);the Applied Basic Research Program of Qingdao(No.16-5-1-5-jch)

摘　　要：Binary sequences with large linear complexity have been found many applications in communication systems.We determine the linear complexity of a family of p^2-periodic binary sequences derived from polynomial quotients modulo an odd prime p.Results show that these sequences have high linear complexity,which means they can resist the linear attack method.Binary sequences with large linear complexity have been found many applications in communi- cation systems. We determine the linear complexity of a family of p^2-periodic binary sequences derived from polynomial quotients modulo an odd prime p. Results show that these sequences have high linear complexity, which means they can resist the linear attack method.

关 键 词：CRYPTOGRAPHY Polynomial quotient Fermat quotient Pseudo-random sequences Linear complexity 

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