2000 character limit reached
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products (1912.06134v1)
Published 13 Dec 2019 in math.NT and cs.CR
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.