Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$

DOI10.1007/978-3-030-42921-8_33zbMath1500.94026OpenAlexW3014582115MaRDI QIDQ5040426

Vladimir Edemskiy, Nikita Sokolovskiy

Publication date: 14 October 2022

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-42921-8_33

zbMATH Keywords

finite fieldlinear complexitycyclotomy\(q\)-ary sequences

Mathematics Subject Classification ID

(q)-calculus and related topics (05A30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Cyclotomy (11T22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of binary threshold sequences from Fermat quotients
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• The linear complexity of generalized cyclotomic sequences with period \(2p^n\)
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
• New generalized cyclotomy and its applications
• New generalized cyclotomic binary sequences of period \(p^2\)
• On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\)
• A further study of the linear complexity of new binary cyclotomic sequence of length \(p^r\)
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• The linear complexity of generalized cyclotomic binary sequences of period \(p^n\)
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• A generalization of the Hall's sextic residue sequences
• Optimal Frequency Hopping Sequences of Odd Length
• New Solutions of a p - 1 ≡1 (mod p 2 )

This page was built for publication: Linear Complexity of New q-ary Generalized Cyclotomic Sequences of Period $$2p^n$$