Linear complexity of generalized cyclotomic sequences of order 4 over F_l

DOI10.1155/2020/6963487zbMATH Open1435.94117arXiv1303.6378OpenAlexW3010958795MaRDI QIDQ2173752FDOQ2173752

Qiuyan Wang, Tongjiang Yan, Yuhua Sun, Hui Li, Yang Yan

Publication date: 17 April 2020

Published in: Complexity (Search for Journal in Brave)

Abstract: Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences of order 4 is developed over a finite field F_l. Results show that in many cases they have high linear complexity.

Full work available at URL: https://arxiv.org/abs/1303.6378

Recommendations

• Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems
• Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
• Research on linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2{p^m}\)
• Linear complexity of generalized cyclotomic binary sequences of order 2
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)

Mathematics Subject Classification ID

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

Cites Work

• Linear complexity of generalized cyclotomic binary sequences of order 2
• New generalized cyclotomy and its applications
• Cyclic codes from cyclotomic sequences of order four
• On cyclotomic generator of order \(r\).
• Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autocorrelation values of generalized cyclotomic sequences of order two
• Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
• Cyclic Codes From the Two-Prime Sequences
• Remarks on a cyclotomic sequence
• A family of difference sets
• The Linear Complexity of Whiteman's Generalized Cyclotomic Sequences of Period $p^{m+1}q^{n+1}$
• On the linear complexity of Hall's sextic residue sequences
• Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
• About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\)
• Pattern distributions of Legendre sequences
• A Unified Approach to Whiteman's and Ding-Helleseth's Generalized Cyclotomy Over Residue Class Rings
• On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)

Cited In (5)

• The linear complexity of related prime sequences
• A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
• ON THE LINEAR COMPLEXITY OF SOME GENERALIZED CYCLOTOMIC SEQUENCES
• On cyclotomic generator of order \(r\).

This page was built for publication: Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)

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