On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients  

作　　者：LUO Bingyu ZHANG Jingwei ZHAO Chang’an 

机构地区：[1]School of Mathematics,Sun Yat-sen University,Guangzhou 510275,China [2]School of Information Science,Guangdong University of Finance and Economics,Guangzhou 510320,China [3]Guangdong Key Laboratory of Information Security,Guangzhou 510006,China [4]State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China

出　　处：《Chinese Journal of Electronics》2023年第2期262-272,共11页电子学报（英文版）

基　　金：supported by Guangdong Major Project of Basic and Applied Basic Research(2019B030302008);the National Natural Science Foundation of China(61972428);the Open Fund of State Key Laboratory of Information Security(Institute of Information Engineering,Chinese Academy of Sciences)(2020-ZD-02);Guangdong Basic and Applied Basic Research Foundation(2019A1515011797).

摘　　要：In this paper,a family of binary sequences derived from Euler quotients with RSA modulus pq is introduced.Here two primes p and q are distinct and satisfy gcd(pq,(p−1)(q−1))=1.The linear complexities and minimal polynomials of the proposed sequences are determined.Besides,this kind of sequences is shown not to have correlation of order four although there exist some special relations by the properties of Euler quotients.

关 键 词：CRYPTOGRAPHY Binary sequences Linear complexity Euler quotients RSA modulus 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]