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

TL;DR

This paper calculates the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences, demonstrating their robustness against rational approximation attacks, which is important for cryptographic security.

Contribution

It provides the first computation of 2-adic complexity for these specific sequences, showing they have strong cryptographic resistance.

Findings

2-adic complexity is sufficiently high against attacks

Sequences are suitable for cryptographic applications

Enhances understanding of sequence security properties

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.