arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.02083cs.ITmath.IT
收藏

广义不可约二元Goppa码的个数

The number of extended irreducible binary Goppa codes

Bocong Chen, Guanghui Zhang

摘要:

Goppa在20世纪70年代发现了代数几何和码之间的关系,这导致了Goppa码家族。Goppa码族是线性码中最有趣的子类之一,常被选为McEliece密码体制的密钥。对于固定参数的不等价的二进制Goppa码的数量的知识可以促进在这样的密码系统的安全性的评估。令$n\geq5$是奇素数,令$q=2^n$和令$r\geq3$是满足$\gcd(r,n)=1$的正整数。本文的目的是建立长度为$q+1$和次数为$r$的不等价的扩展不可约二元Goppa码的个数的上界,其中一个潜在的数学目标是计算有限域$\mathbb{F}_q$上所有一元不可约$r$多项式的集合$\mathcal{I}_r$上的射影半线性群${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$的轨道个数.给出了${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$在$\mathcal{I}_r$上的轨道数的一个显式表达式,并由此导出了长度为$q+1$、次数为$r$的不等价扩展不可约二元Goppa码的数目的一个上界.我们的主要结果自然包含Ryan(IEEE-TIT 2015),Huang和Yue(IEEE-TIT,2022)以及Chen和Zhang(IEEE-TIT,2022)的主要结果,它们分别考虑了$r=4$,$r=6$和$\gcd(r,q^3-q)=1$的情况。

英文摘要:

Goppa, in the 1970s, discovered the relation between algebraic geometry and codes, which led to the family of Goppa codes. As one of the most interesting subclasses of linear codes, the family of Goppa codes is often chosen as a key in the McEliece cryptosystem. Knowledge of the number of inequivalent binary Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. Let $n\geq5$ be an odd prime number, let $q=2^n$ and let $r\geq3$ be a positive integer satisfying $\gcd(r,n)=1$. The purpose of this paper is to establish an upper bound on the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$.A potential mathematical object for this purpose is to count the number of orbits of the projective semi-linear group ${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$ on the set $\mathcal{I}_r$ of all monic irreducible polynomials of degree $r$ over the finite field $\mathbb{F}_q$. An explicit formula for the number of orbits of ${\rm PGL}_2(\mathbb{F}_q)\rtimes{\rm Gal}(\mathbb{F}_{q^r}/\mathbb{F}_2)$ on $\mathcal{I}_r$ is given, and consequently, an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$ is derived. Our main result naturally contains the main results of Ryan (IEEE-TIT 2015), Huang and Yue (IEEE-TIT, 2022) and, Chen and Zhang (IEEE-TIT, 2022), which considered the cases $r=4$, $r=6$ and $\gcd(r,q^3-q)=1$ respectively.

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

↑