The linear complexity of new binary cyclotomic sequences of period $p^n$
arXiv:1712.03947v17 citations
Originality Synthesis-oriented
AI Analysis
This work addresses a problem in cryptography for designing secure sequences, but it is incremental as it builds on prior constructions.
The paper determines the linear complexity of a class of binary cyclotomic sequences with period p^n, proving a conjecture by Xiao et al. about their high linear complexity.
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.