On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
作者机构：School of Mathematics Sun Yat-sen University School of Information Science Guangdong University of Finance and Economics Guangdong Key Laboratory of Information Security State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences
出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))
年 卷 期：2023年第32卷第2期
页 面：262-272页
核心收录：
学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）]
基 金：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)
主 题：Correlation Complexity theory Cryptography Random sequences
摘 要：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.
同方期刊数据库
