The linear complexity of new binary cyclotomic sequences of period pⁿ

2017/12/11 by Edemskiy, Vladimir
#94A55 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1712.03947

Abstract

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.

Related

• Linear complexity of generalized cyclotomic sequences of period 2p^m
• A further study on the linear complexity of new binary cyclotomic sequence of length p^r
• On error linear complexity of new generalized cyclotomic binary sequences of period p²
• About the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
• Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order