English
Related papers

Related papers: The Linear Complexity of a Class of Binary Sequenc…

200 papers

Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design.…

Information Theory · Computer Science 2017-07-26 Wei Su , Yang Yang , Cuiling Fan

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Information Theory · Computer Science 2019-05-01 Minghui Yang , Lulu Zhang , Keqin Feng

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such…

Information Theory · Computer Science 2021-05-31 Qiuyue Liu , Shiyuan Qiang , Minghui Yang , Keqin Feng

The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of…

Cryptography and Security · Computer Science 2018-01-29 Shidong Zhang , Tongjiang Yan

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on interleaving technique and Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., https://doi.org/10.1007/s10623-017-0398-5).…

Information Theory · Computer Science 2018-05-08 Yuhua Sun , Tongjiang Yan , Zhixiong Chen

In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with ideal 2-level autocorrelation are uniformly determined. Results…

Cryptography and Security · Computer Science 2013-09-09 Hai Xiong , Longjiang Qu , Chao Li

We examine the linear complexity and the autocorrelation properties of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.

Information Theory · Computer Science 2013-05-17 Vladimir Edemskiy , Andrew Ivanov

A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…

Information Theory · Computer Science 2021-09-10 Yan Wang , Xilin Han , Weiqiong Wang , Ziling Heng

We investigate the $k$-error linear complexity over $\mathbb{F}_p$ of binary sequences of length $2p$ with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method…

Cryptography and Security · Computer Science 2020-01-08 Vladimir Edemskiy

Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary cyclotomic sequences of order four in \cite{S1}. In this…

Information Theory · Computer Science 2022-09-22 Xiaoyan Jing , Zhefeng Xu , Minghui Yang , Keqin Feng

A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the…

Cryptography and Security · Computer Science 2018-05-23 Xina Zhang , Xiaoni Du , Chenhuang Wu

Let $n_1$ and $n_2$ be two distinct primes with $\mathrm{gcd}(n_1-1,n_2-1)=4$. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order $4$. Our results show that this sequence can have very good…

Information Theory · Computer Science 2016-03-08 Priti Kumari , Pramod Kumar Kewat

Sequences with good randomness properties are quite important for stream ciphers. In this paper, a new class of quaternary sequences is constructed by using generalized cyclotomic classes of $\mathbb{Z}_{2p^m}$ $(m\geq1)$. The exact values…

Information Theory · Computer Science 2023-09-11 Qiuyan Wang , Weigang Kong , Yang Yan , Chenhuang Wu , Minghui Yang

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2^n-1)$ with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009),…

Information Theory · Computer Science 2021-07-14 Minghui Yang , Shiyuan Qiang , Xiaoyan Jing , Keqin Feng , Dongdai Lin

Binary sequences with good autocorrelation properties and large linear complexity are useful in stream cipher cryptography. The Sidelnikov-Lempel-Cohn-Eastman (SLCE) sequences have nearly optimal autocorrelation. However, the problem of…

Information Theory · Computer Science 2016-02-19 Şaban Alaca , Goldwyn Millar

In 2008, a class of binary sequences of period $N=4(2^k-1)(2^k+1)$ with optimal autocorrelation magnitude has been presented by Yu and Gong based on an $m$-sequence, the perfect sequence $(0,1,1,1)$ of period $4$ and interleaving technique.…

Information Theory · Computer Science 2020-09-17 Yuhua Sun , Tongjiang Yan , Qiuyan Wang

A general construction of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic and this construction, several classes of binary sequences with optimal autocorrelation and other…

Information Theory · Computer Science 2014-01-14 Tongjiang Yan , Zhixiong Chen , Bao Li

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…

Information Theory · Computer Science 2016-05-18 Yuhua Sun , Yang Yan , Fei Li , Tongjiang Yan , Hui Li

Sequences with low auto-correlation property have been applied in code-division multiple access communication systems, radar and cryptography. Using the inverse Gray mapping, a quaternary sequence of even length $N$ can be obtained from two…

Information Theory · Computer Science 2017-05-17 W Su , Y Yang , Z Zhou , X Tang

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

Information Theory · Computer Science 2020-11-25 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang
‹ Prev 1 2 3 10 Next ›