Finite Fields and Their Applications最新文献

英文中文

Linear codes with few weights over finite fields 有限域上权重较少的线性编码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-09-27 DOI: 10.1016/j.ffa.2024.102509

Linear codes with a few weights have wide applications in digital signatures, authentication codes, secret sharing protocols and some other fields. Using definition sets to construct linear codes is an effective method. In this paper, we investigate a new defining set and obtain linear codes with four weights, five weights and six weights over

F_{p}

, where p is an odd prime number. The parameters and weight distribution of the constructed linear code are completely determined by accurately calculating the exponential sum over the finite field.

只有几个权重的线性编码在数字签名、验证码、秘密共享协议和其他一些领域有着广泛的应用。利用定义集来构造线性编码是一种有效的方法。本文研究了一种新的定义集，并在 Fp（其中 p 是奇素数）上获得了四重、五重和六重的线性编码。通过精确计算有限域上的指数和，可以完全确定所构建线性码的参数和权重分布。

引用次数: 0

The explicit values of the UBCT, the LBCT and the DBCT of the inverse function 反函数的 UBCT、LBCT 和 DBCT 的显式值

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-09-17 DOI: 10.1016/j.ffa.2024.102508

Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower Boomerang Connectivity Table (LBCT) and the Double Boomerang Connectivity Table (DBCT) of a given S-box are crucial tools to analyze its security concerning specific attacks. However, there are currently no research results on determining these tables of a function. The inverse function is crucial for constructing S-boxes of block ciphers with good cryptographic properties in symmetric cryptography. Therefore, extensive research has been conducted on the inverse function, exploring various properties related to standard attacks. Thanks to the recent advances in boomerang cryptanalysis, particularly the introduction of concepts such as UBCT, LBCT, and DBCT, this paper aims to further investigate the properties of the inverse function $F (x) = x^{2^{n} - 2}$ over $F_{2^{n}}$ for arbitrary n. As a consequence, by carrying out certain finer manipulations of solving specific equations over $F_{2^{n}}$ , we give all entries of the UBCT, LBCT of $F (x)$ over $F_{2^{n}}$ for arbitrary n. Besides, based on the results of the UBCT and LBCT for the inverse function, we determine that $F (x)$ is hard when n is odd. Furthermore, we completely compute all entries of the DBCT of $F (x)$ over $F_{2^{n}}$ for arbitrary n. Additionally, we provide the precise number of elements with a given entry by means of the values of some Kloosterman sums. Further, we determine the double boomerang uniformity of $F (x)$ over $F_{2^{n}}$ for arbitrary n. Our in-depth analysis of the DBCT of $F (x)$ contributes to a better evaluation of the S-box's resistance against boomerang attacks.

置换盒（S-boxes）在确保块密码免受各种攻击方面发挥着重要作用。给定 S 盒的上回旋镖连接表（UBCT）、下回旋镖连接表（LBCT）和双回旋镖连接表（DBCT）是分析其针对特定攻击的安全性的重要工具。然而，目前还没有关于确定这些函数表的研究成果。在对称密码学中，反函数对于构建具有良好密码特性的块密码 S 盒至关重要。因此，人们对反函数进行了广泛的研究，探索与标准攻击相关的各种特性。得益于最近在回旋镖密码分析领域取得的进展，特别是 UBCT、LBCT 和 DBCT 等概念的引入，本文旨在进一步研究任意 n 的反函数 F(x)=x2n-2 over F2n 的性质。因此，通过对 F2n 上的特定方程进行某些更精细的求解操作，我们给出了任意 n 时 F2n 上 F(x) 的 UBCT、LBCT 的所有项。此外，对于任意 n，我们完全计算了 F(x) 在 F2n 上的 DBCT 的所有条目。我们对 F(x) DBCT 的深入分析有助于更好地评估 S 盒对回旋镖攻击的抵抗力。

{"title":"The explicit values of the UBCT, the LBCT and the DBCT of the inverse function","authors":"","doi":"10.1016/j.ffa.2024.102508","DOIUrl":"10.1016/j.ffa.2024.102508","url":null,"abstract":"<div>Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower Boomerang Connectivity Table (LBCT) and the Double Boomerang Connectivity Table (DBCT) of a given S-box are crucial tools to analyze its security concerning specific attacks. However, there are currently no research results on determining these tables of a function. The inverse function is crucial for constructing S-boxes of block ciphers with good cryptographic properties in symmetric cryptography. Therefore, extensive research has been conducted on the inverse function, exploring various properties related to standard attacks. Thanks to the recent advances in boomerang cryptanalysis, particularly the introduction of concepts such as UBCT, LBCT, and DBCT, this paper aims to further investigate the properties of the inverse function <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>=</mo><msup><mrow><mi>x</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup><mo>−</mo><mn>2</mn></mrow></msup></math> over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math> for arbitrary n. As a consequence, by carrying out certain finer manipulations of solving specific equations over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math>, we give all entries of the UBCT, LBCT of <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math> for arbitrary n. Besides, based on the results of the UBCT and LBCT for the inverse function, we determine that <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> is hard when n is odd. Furthermore, we completely compute all entries of the DBCT of <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math> for arbitrary n. Additionally, we provide the precise number of elements with a given entry by means of the values of some Kloosterman sums. Further, we determine the double boomerang uniformity of <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mn>2</mn></mrow><mrow><mi>n</mi></mrow></msup></mrow></msub></math> for arbitrary n. Our in-depth analysis of the DBCT of <math><mi>F</mi><mo>(</mo><mi>x</mi><mo>)</mo></math> contributes to a better evaluation of the S-box's resistance against boomerang attacks.</div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142240735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Oriented supersingular elliptic curves and Eichler orders of prime level 有向超星椭圆曲线和素级艾希勒阶

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-09-17 DOI: 10.1016/j.ffa.2024.102501

<div>Let <math><mi>p</mi><mo>></mo><mn>3</mn></math> be a prime and E be a supersingular elliptic curve defined over <math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>p</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></msub></math>. Let c be a prime with <math><mi>c</mi><mo><</mo><mn>3</mn><mi>p</mi><mo>/</mo><mn>16</mn></math> and G be a subgroup of <math><mi>E</mi><mo>[</mo><mi>c</mi><mo>]</mo></math> of order c. The pair <math><mo>(</mo><mi>E</mi><mo>,</mo><mi>G</mi><mo>)</mo></math> is called a supersingular elliptic curve with level-c structure, and the endomorphism ring <math><mtext>End</mtext><mo>(</mo><mi>E</mi><mo>,</mo><mi>G</mi><mo>)</mo></math> is isomorphic to an Eichler order with level c. We construct two kinds of Eichler orders <math><msub><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>,</mo><mi>r</mi><mo>)</mo></math> and <math><msubsup><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>q</mi><mo>,</mo><msup><mrow><mi>r</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo></math> with level c. Interestingly, we prove that each <math><msub><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>,</mo><mi>r</mi><mo>)</mo></math> or <math><msubsup><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>q</mi><mo>,</mo><msup><mrow><mi>r</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo></math> can represent a primitive reduced binary quadratic form with discriminant <math><mo>−</mo><mn>16</mn><mi>c</mi><mi>p</mi></math> or <math><mo>−</mo><mi>c</mi><mi>p</mi></math> respectively. If a curve E is <math><mi>Z</mi><mo>[</mo><msqrt><mrow><mo>−</mo><mi>c</mi><mi>p</mi></mrow></msqrt><mo>]</mo></math>-oriented or <math><mi>Z</mi><mo>[</mo><mfrac><mrow><mn>1</mn><mo>+</mo><msqrt><mrow><mo>−</mo><mi>c</mi><mi>p</mi></mrow></msqrt></mrow><mrow><mn>2</mn></mrow></mfrac><mo>]</mo></math>-oriented, then we prove that <math><mtext>End</mtext><mo>(</mo><mi>E</mi><mo>,</mo><mi>G</mi><mo>)</mo></math> is isomorphic to <math><msub><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow></msub><mo>(</mo><mi>q</mi><mo>,</mo><mi>r</mi><mo>)</mo></math> or <math><msubsup><mrow><mi>O</mi></mrow><mrow><mi>c</mi></mrow><mrow><mo>′</mo></mrow></msubsup><mo>(</mo><mi>q</mi><mo>,</mo><msup><mrow><mi>r</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>)</mo></math> respectively. Due to the fact that <math><mi>Z</mi><mo>[</mo><msqrt><mrow><mo>−</mo><mi>c</mi><mi>p</mi></mrow></msqrt><mo>]</mo></math>-oriented isogenies between <math><mi>Z</mi><mo>[</mo><msqrt><mrow><mo>−</mo><mi>c</mi><mi>p</mi></mrow></msqrt><mo>]</mo></math></

设 p>3 是素数，E 是定义在 Fp2 上的超椭圆曲线。让 c 是 c<3p/16 的素数，G 是 E[c] 的一个阶为 c 的子群。这对 (E,G) 称为具有 c 级结构的超椭圆曲线，其内定环 End(E,G) 与具有 c 级结构的艾希勒阶同构。有趣的是，我们证明了每个 Oc(q,r)或 Oc′(q,r′)可以分别表示一个判别式为 -16cp 或 -cp 的原始还原二元二次型。如果曲线 E 是 Z[-cp]-oriented 或 Z[1+-cp2]-oriented 的，那么我们证明 End(E,G) 分别与 Oc(q,r) 或 Oc′(q,r′)同构。由于 Z[-cp]-oriented 椭圆曲线之间的 Z[-cp]-oriented 同素异形可以用二次型来表示，我们证明了这些同素异形通过相应二次型的组成法则反映在相应的艾希勒阶中。

引用次数: 0

On the duality of cyclic codes of length ps over Fpm[u]〈u3〉论Fpm[u]〈u3〉上长度为ps的循环码的对偶性

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-09-04 DOI: 10.1016/j.ffa.2024.102500

In this paper, we determine the dual codes of cyclic codes of length $p^{s}$ over $R_{3} = \frac{F_{p^{m}} [u]}{〈 u^{3} 〉}$ , where p is a prime number and $u^{3} = 0$ . Also, we improve and give correction of the results stated by B. Kim and J. Lee (2020) in [11]. Finally, we provide some examples of optimal and near-MDS cyclic codes of length $p^{s}$ over $R_{3}$ and compute dual of them.

在本文中，我们确定了 R3 上长度为 ps 的循环码的对偶码=Fpm[u]〈u3〉，其中 p 是素数且 u3=0。同时，我们改进并修正了 B. Kim 和 J. Lee (2020) 在 [11] 中所述的结果。最后，我们举例说明了 R3 上长度为 ps 的最优和近 MDS 循环码，并计算了它们的对偶性。

引用次数: 0

Denniston partial difference sets exist in the odd prime case 奇素数情况下存在丹尼斯顿偏差集

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-09-03 DOI: 10.1016/j.ffa.2024.102499

<div>Denniston constructed partial difference sets (PDSs) with the parameters <math><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup><mo>,</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>,</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>+</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>2</mn><mo>)</mo><mo>,</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>)</mo></math> in elementary abelian groups of order <math><msup><mrow><mn>2</mn></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup></math> for all <math><mi>m</mi><mo>≥</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>≤</mo><mi>r</mi><mo><</mo><mi>m</mi></math>. These correspond to maximal arcs in Desarguesian projective planes of even order. In this paper, we show that - although maximal arcs do not exist in Desarguesian projective planes of odd order - PDSs with the Denniston parameters <math><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup><mo>,</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>,</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>+</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>2</mn><mo>)</mo><mo>,</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mi>p</mi></mrow><mrow

丹尼斯顿构造了参数为(23m,(2m+r-2m+2r)(2m-1),2m-2r+(2m+r-2m+2r)(2r-2),(2m+r-2m+2r)(2r-1))的23m阶基本阿贝尔群中的局部差集（PDSs），对于所有m≥2,1≤r<m。这些弧对应于偶数阶笛卡尔投影面中的最大弧。在本文中，我们将证明--尽管奇阶笛卡尔投影面中不存在最大弧--但具有丹尼斯顿参数 (p3m,(pm+r-pm+pr)(pm-1)、pm-pr+(pm+r-pm+pr)(pr-2),(pm+r-pm+pr)(pr-1))的 PDS 存在于所有 m≥2,r∈{1,m-1} 的 p3m 阶基本阿贝尔群中，其中 p 是奇素数。我们的方法使用的 PDS 是环类的联合。

引用次数: 0

The resultant method in higher dimensions 高维度结果法

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-08-30 DOI: 10.1016/j.ffa.2024.102493

Stability results play an important role in Galois geometries. The famous resultant method, developed by Szőnyi and Weiner [12], [11], became very fruitful and resulted in many stability theorems in the last two decades. This method is based on some bivariate polynomials associated to point sets. In this paper we generalize the method for the multidimensional case and show some new applications. We build up the multivariate polynomial machinery and apply it for Rédei polynomials. We can prove a high dimensional analogue of the result of Szőnyi-Weiner [9], concerning the number of hyperplanes being skew to a point set of the space. We prove general results on “partial blocking sets”, using the tools we have developed.

稳定性结果在伽罗瓦几何中发挥着重要作用。由 Szőnyi 和 Weiner [12], [11] 提出的著名的结果法在过去二十年中取得了丰硕成果，并产生了许多稳定性定理。该方法基于与点集相关的一些双变量多项式。在本文中，我们将该方法推广到多维情况，并展示了一些新的应用。我们建立了多变量多项式机制，并将其应用于雷代多项式。我们可以证明 Szőnyi-Weiner [9] 结果的高维类比，涉及向空间点集倾斜的超平面数量。我们利用所开发的工具证明了 "部分阻塞集 "的一般结果。

引用次数: 0

Achromatic colorings of polarity graphs 极性图的消色性着色

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-08-30 DOI: 10.1016/j.ffa.2024.102497

A complete partition of a graph G is a partition of the vertex set such that there is at least one edge between any two parts. The largest r such that G has a complete partition into r parts, each of which is an independent set, is the achromatic number of G. We determine the achromatic number of polarity graphs of biaffine planes coming from generalized polygons. Our colorings of a family of unitary polarity graphs are used to solve a problem of Axenovich and Martin on complete partitions of $C_{4}$ -free graphs. Furthermore, these colorings prove that there are sequences of graphs which are optimally complete and have unbounded degree, a problem that had been studied for the sequence of hypercubes independently by Roichman, and Ahlswede, Bezrukov, Blokhuis, Metsch, and Moorhouse.

图 G 的完整分割是顶点集的分割，使得任意两部分之间至少有一条边。我们确定了来自广义多边形的双折线平面极性图的消色数。我们对单元极性图族的着色用于解决阿克森诺维奇和马丁关于无 C4 图的完全分割的问题。此外，这些着色证明了存在最优完整且度无界的图序列，这个问题曾由罗伊克曼、阿尔斯韦德、贝兹鲁科夫、布洛克胡斯、梅奇和穆尔豪斯独立研究过超立方体序列。

引用次数: 0

A note on (2,2)-isogenies via theta coordinates 通过 Theta 坐标的 (2,2)-isogenies 注释

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-08-30 DOI: 10.1016/j.ffa.2024.102496

In this paper, we revisit the algorithm for computing chains of $(2, 2)$ -isogenies between products of elliptic curves via theta coordinates proposed by Dartois et al. For each fundamental block of this algorithm, we provide an explicit inversion-free version. Besides, we exploit the technique of x-only ladder to speed up the computation of gluing isogeny. Finally, we present a mixed optimal strategy, which combines the inversion-elimination tool with the original methods together to execute a chain of $(2, 2)$ -isogenies.

We make a cost analysis and present a concrete comparison between ours and the previously known methods for inversion elimination. Furthermore, we implement the mixed optimal strategy for benchmark. The results show that when computing $(2, 2)$ -isogeny chains with lengths of 126, 208 and 632, compared to Dartois, Maino, Pope and Robert's latest implementation, utilizing our techniques can reduce 9.7%, 9.5% and 9.6% multiplications over the base field $F_{p}$ , respectively. Therefore, even for the updated version that employs their inversion-free algorithms, our tools still possess an advantage.

本文重温了 Dartois 等人提出的通过 Theta 坐标计算椭圆曲线乘积间 (2,2)-isogeny 链的算法。此外，我们还利用仅 x 梯形技术加快了胶合同源性的计算速度。最后，我们提出了一种混合最优策略，它将反转消除工具和原始方法结合在一起，以执行 (2,2)-isogenies 链。我们进行了成本分析，并具体比较了我们的方法和之前已知的反转消除方法。此外，我们还实施了混合最优策略作为基准。结果表明，在计算长度为 126、208 和 632 的 (2,2)-isogeny 链时，与 Dartois、Maino、Pope 和 Robert 的最新实现相比，利用我们的技术可以在基域 Fp 上分别减少 9.7%、9.5% 和 9.6% 的乘法运算。因此，即使是采用他们的无反转算法的更新版本，我们的工具仍然具有优势。

{"title":"A note on (2,2)-isogenies via theta coordinates","authors":"","doi":"10.1016/j.ffa.2024.102496","DOIUrl":"10.1016/j.ffa.2024.102496","url":null,"abstract":"<div>In this paper, we revisit the algorithm for computing chains of <math><mo>(</mo><mn>2</mn><mo>,</mo><mn>2</mn><mo>)</mo></math>-isogenies between products of elliptic curves via theta coordinates proposed by Dartois et al. For each fundamental block of this algorithm, we provide an explicit inversion-free version. Besides, we exploit the technique of x-only ladder to speed up the computation of gluing isogeny. Finally, we present a mixed optimal strategy, which combines the inversion-elimination tool with the original methods together to execute a chain of <math><mo>(</mo><mn>2</mn><mo>,</mo><mn>2</mn><mo>)</mo></math>-isogenies.We make a cost analysis and present a concrete comparison between ours and the previously known methods for inversion elimination. Furthermore, we implement the mixed optimal strategy for benchmark. The results show that when computing <math><mo>(</mo><mn>2</mn><mo>,</mo><mn>2</mn><mo>)</mo></math>-isogeny chains with lengths of 126, 208 and 632, compared to Dartois, Maino, Pope and Robert's latest implementation, utilizing our techniques can reduce 9.7%, 9.5% and 9.6% multiplications over the base field <math><msub><mrow><mi>F</mi></mrow><mrow><mi>p</mi></mrow></msub></math>, respectively. Therefore, even for the updated version that employs their inversion-free algorithms, our tools still possess an advantage.</div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142097567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On a recent extension of a family of biprojective APN functions 论双射 APN 函数族的最新扩展

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-08-27 DOI: 10.1016/j.ffa.2024.102494

APN functions play a big role as primitives in symmetric cryptography as building blocks that yield optimal resistance to differential attacks. In this note, we consider a recent extension, done by Calderini et al. (2023), of a biprojective APN family introduced by Göloğlu (2022) defined on $F_{2^{2 m}}$ . We show that this generalization yields functions equivalent to Göloğlu's original family if $3 ∤ m$ . If $3 | m$ we show exactly how many inequivalent APN functions this new family contains. We also show that the family has the minimal image set size for an APN function and determine its Walsh spectrum, hereby settling some open problems. In our proofs, we leverage a group theoretic technique recently developed by Göloğlu and the author in conjunction with a group action on the set of projective polynomials.

APN 函数作为对称密码学中的基元函数，在对抗差分攻击方面发挥着重要作用。在本说明中，我们考虑了 Calderini 等人（2023 年）最近对 Göloğlu (2022 年) 引入的定义在 F22m 上的双投影 APN 族的扩展。我们证明，如果 3∤m，这种泛化会产生与 Göloğlu 的原始族等价的函数。如果是 3|m，我们将精确地证明这个新族包含多少个不等价的 APN 函数。我们还证明了该族具有 APN 函数的最小图像集大小，并确定了它的沃尔什谱，从而解决了一些悬而未决的问题。在证明过程中，我们利用了格罗格鲁和作者最近开发的一种群论技术，并结合了投影多项式集合上的群作用。

引用次数: 0

Four new families of NMDS codes with dimension 4 and their applications 维数为 4 的 NMDS 代码的四个新系列及其应用

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-08-26 DOI: 10.1016/j.ffa.2024.102495

For an ${[n, k, d]}_{q}$ linear code $C$ , the singleton defect of $C$ is defined by $S (C) = n - k + 1 - d$ . When $S (C) = S (C^{⊥}) = 1$ , the code $C$ is called a near maximum distance separable (NMDS) code, where $C^{⊥}$ is the dual code of $C$ . NMDS codes have important applications in finite projective geometries, designs and secret sharing schemes. In this paper, we present four new constructions of infinite families of NMDS codes with dimension 4 and completely determine their weight enumerators. As an application, we also determine the locality of the dual codes of these NMDS codes and obtain four families of distance-optimal and dimension-optimal locally recoverable codes.

对于 [n,k,d]q 线性编码 C，C 的单子缺陷由 S(C)=n-k+1-d 定义。当 S(C)=S(C⊥)=1 时，代码 C 被称为近最大距离可分离（NMDS）代码，其中 C⊥ 是 C 的对偶代码。NMDS 代码在有限投影几何、设计和秘密共享方案中有着重要的应用。在本文中，我们提出了四种维数为 4 的 NMDS 码无穷族的新构造，并完全确定了它们的权枚举器。作为应用，我们还确定了这些 NMDS 码对偶码的局部性，并得到了四个距离最优和维度最优的局部可恢复码族。

{"title":"Four new families of NMDS codes with dimension 4 and their applications","authors":"","doi":"10.1016/j.ffa.2024.102495","DOIUrl":"10.1016/j.ffa.2024.102495","url":null,"abstract":"<div>For an <math><msub><mrow><mo>[</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>d</mi><mo>]</mo></mrow><mrow><mi>q</mi></mrow></msub></math> linear code <math><mi>C</mi></math>, the singleton defect of <math><mi>C</mi></math> is defined by <math><mi>S</mi><mo>(</mo><mi>C</mi><mo>)</mo><mo>=</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>+</mo><mn>1</mn><mo>−</mo><mi>d</mi></math>. When <math><mi>S</mi><mo>(</mo><mi>C</mi><mo>)</mo><mo>=</mo><mi>S</mi><mo>(</mo><msup><mrow><mi>C</mi></mrow><mrow><mo>⊥</mo></mrow></msup><mo>)</mo><mo>=</mo><mn>1</mn></math>, the code <math><mi>C</mi></math> is called a near maximum distance separable (NMDS) code, where <math><msup><mrow><mi>C</mi></mrow><mrow><mo>⊥</mo></mrow></msup></math> is the dual code of <math><mi>C</mi></math>. NMDS codes have important applications in finite projective geometries, designs and secret sharing schemes. In this paper, we present four new constructions of infinite families of NMDS codes with dimension 4 and completely determine their weight enumerators. As an application, we also determine the locality of the dual codes of these NMDS codes and obtain four families of distance-optimal and dimension-optimal locally recoverable codes.</div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":null,"pages":null},"PeriodicalIF":1.2,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142075831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Finite Fields and Their Applications

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀