The 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Order 2 and Period pq

IEEE Access

Shiwen Sun¹  Ming Yan¹  Tongjiang Yan¹  Yuhua Sun¹ 

[1] College of Sciences, China University of Petroleum (East China), Qingdao, China;

关键词: Stream cipher;    pseudo-random sequence;    2-adic complexity;   

DOI  :  10.1109/ACCESS.2020.3012570

来源: DOAJ

【 摘 要 】

This paper considers the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of order 2 and period pq, where p and q are distinct odd primes with gcd(p - 1, q - 1) = 2, p - q - 3 (mod 4). These sequences have been proved to possess good linear complexity. Our results show that the 2-adic complexity of these sequences is at least pq - q - 1. Then it is large enough to resist the attack of the rational approximation algorithm.

【 授权许可】

Unknown