A kind of quaternary sequences of period 2p^mqⁿ and their linear complexity

2020/01/29 by Qiuyan Wang, Chenhuang Wu, Wang, Qiuyan +5
Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2001.10839

openalex publication_date 2020/01/29 · openalex created_date 2020/02/07 · openalex updated_date 2026/07/28

Abstract

Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over \mathbbF₄ with period 2p^mqⁿ is constructed using generalized cyclotomic classes. Results show that the linear complexity of these sequences attains the maximum.

Related

• Autocorrelation and Linear Complexity of Quaternary Sequences of Period 2p Based on Cyclotomic Classes of Order Four
• Autocorrelation of a class of quaternary sequences of period 2p^m
• The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p
• Linear complexity of quaternary sequences over Z₄ derived from generalized cyclotomic classes modulo 2p
• The linear complexity of new binary cyclotomic sequences of period pⁿ