Linear complexity of Ding-Helleseth sequences of order 2 over GF(l)

DOI10.1007/S12095-015-0138-5MaRDI QIDQ267793zbMATH OpenOpenAlexFDO

Authors Qiuyan Wang, Yupeng Jiang, Dongdai Lin

Publication date 11 April 2016

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

Full work available at URL https://doi.org/10.1007/s12095-015-0138-5

zbMATH Keywords

cryptographylinear complexityminimal polynomialsequences

Mathematics Subject Classification ID

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

Recommendations

• Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
• Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
• Linear complexity of a class of pseudorandom sequences over a general finite field
• On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six

Cites work

• Autocorrelation values of generalized cyclotomic sequences of order two
• Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^m)\)
• Cyclic codes from cyclotomic sequences of order four
• Cyclic Codes From the Two-Prime Sequences
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 1196713 (Why is no real title available?)
• scientific article; zbMATH DE number 1182117 (Why is no real title available?)
• scientific article; zbMATH DE number 3252237 (Why is no real title available?)
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
• Linear complexity of generalized cyclotomic binary sequences of order 2
• Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
• New generalized cyclotomy and its applications
• On cyclotomic generator of order \(r\).
• On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
• The stability theory of stream ciphers
• The vulnerability of geometric sequences based on fields of odd characteristic

Cited in

(12)

• On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
• Linear complexity of a class of pseudorandom sequences over a general finite field
• Linear complexity of some sequences derived from hyperelliptic curves of genus 2
• A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
• Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
• Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
• Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight
• Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2p^m
• On the linear complexity of Ding-Helleseth generalized cyclotomic binary sequences of order four and six
• Generalized cyclotomic numbers of order two and their applications
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
• Linear complexity of Ding generalized cyclotomic sequences

This page was built for publication: Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)

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