The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure

TL;DR

This paper investigates the 2-adic complexity of two classes of binary sequences with interleaved structures, demonstrating that their complexity is sufficiently high to withstand rational approximation attacks.

Contribution

It provides the first analysis of the 2-adic complexity for these specific binary sequences with interleaved structures.

Findings

2-adic complexity is large enough to resist attacks

Sequences have good autocorrelation properties

Analysis extends understanding of sequence security

Abstract

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.