arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.18570math.NTcs.ITmath.IT
收藏

利用椭圆曲线构造的一类具有低相关性的新二元序列族

A new family of binary sequences with a low correlation via elliptic curves

Lingfei Jin, Liming Ma, Chaoping Xing, Runtian Zhu

AI总结:

本文利用椭圆曲线有理点的循环群结构,设计了一族长度为 $2^n+1+t$ 且具有低相关性和大线性复杂度的新二元序列,为序列构造提供了新方法。

摘要:

在现代数字通信、密码学和信号处理领域,具有低相关性的二元序列发挥着关键作用。文献中已有大量致力于构造各种长度的优质二元序列的研究,并提出了众多构造方法。然而,大多数已知构造利用了有限域 $\mathbb{F}_{p^n}$ 的乘法循环群结构,其中 $p$ 为素数,$n$ 为正整数。最近,作者利用了有限域 $\mathbb{F}_{p^n}$ 上有理函数域的所有有理位的循环群结构,并首次通过 $\mathbb{F}_{p^n}$ 上的分圆函数域为任意素数 $p$ 构造了长度为 $p^n+1$ 的优质二元序列 \cite{HJMX24,JMX22}。该方法为构造优质二元序列开辟了新途径。受上述构造启发,我们利用椭圆曲线有理点上的循环群结构,针对许多给定整数 $|t|\le 2^{(n+2)/2}$,设计了一族长度为 $2^n+1+t$ 且具有低相关性的二元序列。具体而言,对于任意满足 $\gcd(d,2^n+1+t)=1$ 的正整数 $d$,我们通过椭圆曲线引入了一族新的二元序列,其长度为 $2^n+1+t$,大小为 $q^{d-1}-1$,相关性界限为 $(2d+1) \cdot 2^{(n+2)/2}+ |t|$,并具有大的线性复杂度。

英文摘要:

In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, considerable efforts have been dedicated to constructing good binary sequences of various lengths. As a consequence, numerous constructions of good binary sequences have been put forward. However, the majority of known constructions leverage the multiplicative cyclic group structure of finite fields $\mathbb{F}_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Recently, the authors made use of the cyclic group structure of all rational places of the rational function field over the finite field $\mathbb{F}_{p^n}$, and firstly constructed good binary sequences of length $p^n+1$ via cyclotomic function fields over $\mathbb{F}_{p^n}$ for any prime $p$ \cite{HJMX24,JMX22}. This approach has paved a new way for constructing good binary sequences. Motivated by the above constructions, we exploit the cyclic group structure on rational points of elliptic curves to design a family of binary sequences of length $2^n+1+t$ with a low correlation for many given integers $|t|\le 2^{(n+2)/2}$. Specifically, for any positive integer $d$ with $\gcd(d,2^n+1+t)=1$, we introduce a novel family of binary sequences of length $2^n+1+t$, size $q^{d-1}-1$, correlation bounded by $(2d+1) \cdot 2^{(n+2)/2}+ |t|$, and a large linear complexity via elliptic curves.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑