数学
计算机科学
计算复杂性理论
离散数学
理论计算机科学
域代数上的
算法
纯数学
作者
Shiwen Sun,Tongjiang Yan,Yuhua Sun,Ming Yan
出处
期刊:IEEE Access
[Institute of Electrical and Electronics Engineers]
日期:2020-01-01
卷期号:8: 140478-140485
被引量:4
标识
DOI:10.1109/access.2020.3013122
摘要
This paper contributes to analyze the 2-adic complexity of a class of Ding-Helleseth generalized cyclotomic sequences and a class of Whiteman generalized cyclotomic sequences of periods of $N=pq$ , where $p$ and $q$ are two odd distinct primes with $\mathrm {gcd}(p-1,q-1)=2$ satisfying $p\equiv q\equiv 3\pmod 4$ . The results show that the 2-adic complexity of these sequences is at least $pq-p-q-1$ . Then it is large enough to resist the attacks of rational approximation algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI