Linear complexity of binary generalized cyclotomic sequences over GF(q)
DOI10.1016/J.JCO.2015.01.001zbMATH Open1381.94056OpenAlexW2058674058MaRDI QIDQ491089FDOQ491089
Authors: Qiuyan Wang, Yupeng Jiang, Dongdai Lin 
Publication date: 24 August 2015
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2015.01.001
Recommendations
- Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- The stability theory of stream ciphers
- 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
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Title not available (Why is that?)
- Cyclic Codes From the Two-Prime Sequences
- Linear Complexity and Random Sequences
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
Cited In (14)
- Cyclic codes via the general two-prime generalized cyclotomic sequence of order two
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- On linear complexity of sequences over \(\text{GF}(2^n)\)
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
- A new class of quaternary generalized cyclotomic sequences of order 2d and length 2pm with high linear complexity
- Linear complexity of a class of pseudorandom sequences over a general finite field
- On the linear complexity of Hall's sextic residue sequences over \(\mathrm{GF}(q)\)
- Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\)
- Linearity properties of binary FCSR sequences
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
- Binomial representation of cryptographic binary sequences and its relation to cellular automata
- Linear complexity of binary cyclotomic sequences of order 6
- On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation
- A kind of quaternary sequences of period \(2 p^m q^n\) and their linear complexity
This page was built for publication: Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491089)
