Linear Complexity of a Family of Binary pq 2-Periodic Sequences From Euler Quotients

DOI10.1109/TIT.2020.2979838MaRDI QIDQ5124540zbMATH OpenFDO

Authors Jingwei Zhang, Shuhong Gao, Chang-An Zhao

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1906.08083

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Abstract: We first introduce a family of binary $p{q}^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined for the proposed sequences provided that $2^{q-1}otequiv1mod{q}^2.$ The results show that the proposed sequences have high linear complexities.

Cited in

(3)

• Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
• Optimal Families of Perfect Polyphase Sequences From the Array Structure of Fermat-Quotient Sequences
• Linear complexity of r-ary sequences derived from Euler quotient modulo pq

This page was built for publication: Linear Complexity of a Family of Binary pq ²-Periodic Sequences From Euler Quotients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124540)