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

中文翻译：

---

计算两类Ding-Helleseth广义孪生素周期周期的2-adic复杂度

本文有助于计算两类Ding-Helleseth广义环序列的2-adic复杂度。结果表明，这些序列的2-adic复杂度足以抵抗有理逼近算法的攻击。