A further study of the linear complexity of new binary cyclotomic sequence of length p^r

DOI10.1007/S00200-018-0368-9zbMATH Open1416.94037arXiv1712.08886OpenAlexW2792052100MaRDI QIDQ2002148FDOQ2002148

Zhifan Ye, Pinhui Ke, Chenhuang Wu

Publication date: 11 July 2019

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: Recently, a conjecture on the linear complexity of a new class of generalized cyclotomic binary sequences of period $p^r$ was proposed by Z. Xiao et al. (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0408-7). Later, for the case $f$ being the form $2^r$ with $rge1$, Vladimir Edemskiy proved the conjecture (arXiv:1712.03947). In this paper, under the assumption of $$ and $gcd(fracp-1{mord}_p(2),f)=1$, the conjecture proposed by Z. Xiao et al. is proved for a general $f$ by using the Euler quotient. Actually, a generic construction of $p^r$-periodic binary sequence based on the generalized cyclotomy is introduced in this paper, which admits a flexible support set and includes Xiao's construction as a special case, and then an efficient method to compute the linear complexity of the sequence by the generic construction is presented, based on which the conjecture proposed by Z. Xiao et al. could be easily proved under the aforementioned assumption.

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

zbMATH Keywords

linear complexitybinary sequencegeneralized cyclotomyEuler quotient

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shift-register synthesis and BCH decoding
• An extension of binary threshold sequences from Fermat quotients
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• Optimal Frequency Hopping Sequences of Odd Length
• Trace representation of pseudorandom binary sequences derived from Euler quotients
• Finding an internal state of RC4 stream cipher
• On the k-error linear complexity of binary sequences derived from polynomial quotients
• New generalized cyclotomic binary sequences of period \(p^2\)

Cited In (7)

• Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$
• On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
• Linear complexity of generalized cyclotomic sequences with period \(p^nq^m\)
• New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
• Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)

This page was built for publication: A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)

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