Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products

2019/12/13 by Ming Yan, Yan, Ming, Tongjiang Yan +3
Computer Science · #Coding theory and cryptography #Chaos-based Image/Signal Encryption #Cryptography and Residue Arithmetic

paper · pdf · doi:10.48550/arxiv.1912.06134

Abstract

This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.

Related

• A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period pⁿ
• On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
• Further results on the 2-adic complexity of a class of balanced generalized cyclotomic sequences
• Linear complexity over \mathbbF_q and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation
• A New Method to Compute the 2-adic Complexity of Binary Sequences