New classes of quaternary cyclotomic sequence of length 2p^m with high linear complexity

DOI10.1016/J.IPL.2012.05.011zbMATH Open1250.94037OpenAlexW1975333019MaRDI QIDQ456074FDOQ456074

Authors: Pinhui Ke, Shengyuan Zhang 

Publication date: 23 October 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.05.011

Recommendations

• A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
• Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
• Research on linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2{p^m}\)
• Linear complexity of new \(q\)-ary generalized cyclotomic sequences of period \(2p^n\)
• Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
• Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems
• A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
• The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
• Linear complexity of balanced quaternary generalized cyclotomic sequences with period \(pq\)
• A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)

zbMATH Keywords

cryptographylinear complexityquaternary sequencegeneralized cyclotomic sequence

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Shift-register synthesis and BCH decoding
• Title not available (Why is that?)
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• Linear Complexity of Some Generalized Cyclotomic Sequences
• Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
• New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
• Linear Complexity and Autocorrelation of Prime Cube Sequences
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)

Cited In (12)

• On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
• A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
• On the properties of generalized cyclotomic binary sequences of period \(2p^m\)
• New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity
• Autocorrelation values of quaternary cyclotomic sequence of length \(2p^m\)
• On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
• The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\)
• A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
• Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
• New classes of asymptotically optimal spectrally-constrained sequences derived from cyclotomy
• Some new classes of quaternary sequences with low autocorrelation property via two binary cyclotomic sequences
• A new optimal quaternary sequence family of length \(2(2^{n}-1)\) obtained from the orthogonal transformation of families \({\mathcal{B}}\) and \({\mathcal{C}}\)

This page was built for publication: New classes of quaternary cyclotomic sequence of length \(2p^m\) with high linear complexity

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