Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)

DOI10.1007/s12095-015-0138-5zbMath1344.94027MaRDI QIDQ267793

Yupeng Jiang, Qiuyan Wang, Dong-Dai 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

sequences; cryptography; minimal polynomial; linear complexity

Mathematics Subject Classification ID

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

94A60: Cryptography

Related Items

Generalized cyclotomic numbers of order two and their applications, 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 generalized cyclotomic binary sequences of order 2d and length 2pm

Cites Work

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