LUO Bingyu, ZHANG Jingwei, ZHAO Chang’an. On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients[J]. Chinese Journal of Electronics, 2023, 32(2): 262-272. DOI: 10.23919/cje.2020.00.125
Citation: LUO Bingyu, ZHANG Jingwei, ZHAO Chang’an. On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients[J]. Chinese Journal of Electronics, 2023, 32(2): 262-272. DOI: 10.23919/cje.2020.00.125

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

  • 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.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return