# Note about the linear complexity of new generalized cyclotomic binary sequences of period $2p^n$

## TL;DR

This paper investigates the linear complexity of newly proposed generalized cyclotomic binary sequences with period 2p^n, extending previous results and discussing related conjectures to understand their cryptographic strength.

## Contribution

It generalizes prior findings on the linear complexity of these sequences and explores the validity of the author's conjecture.

## Key findings

- Extended the analysis of linear complexity to broader classes of sequences.
- Provided evidence supporting or refuting the conjecture.
- Enhanced understanding of the sequences' cryptographic properties.

## Abstract

This paper examines the linear complexity of new generalized cyclotomic binary sequences of period $2p^n$ recently proposed by Yi Ouang et al. (arXiv:1808.08019v1 [cs.IT] 24 Aug 2018). We generalize results obtained by them and discuss author's conjecture of this paper.