Design sequences with high linear complexity over finite fields using generalized cyclotomy

DOI10.1007/s12095-016-0209-2zbMath1369.94510OpenAlexW2560593074MaRDI QIDQ2400721

Vladimir Edemskiy, Xiaoni Du

Publication date: 30 August 2017

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-016-0209-2

zbMATH Keywords

finite fieldsdiscrete Fourier transformlinear complexitypseudorandom sequencesgeneralized cyclotomy sequences

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (1)

Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• New generalized cyclotomy and its applications
• On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
• A generalization of the Hall's sextic residue sequences
• The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
• A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets
• On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences
• A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings

This page was built for publication: Design sequences with high linear complexity over finite fields using generalized cyclotomy