arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.14349math.NTmath.AC
收藏

环$\mathbb{F}_{q^n}$上的线性置换及其合成逆

Linear Permutations and their Compositional Inverses over $\mathbb{F}_{q^n}$

Gustavo Terra Bastos

摘要:

置换多项式的使用,以及它们的合成逆,已经成为密码系统实现中的一个很好的选择。因此,需要构造系数属于有限域的这些多项式。作为置换多项式的一种特殊情况,对合是非常需要的,因为它的合成逆是它自己。在这项工作中,我们提出了一种有效的方法,如何构造几个线性置换多项式在$\mathbb{F}_{q^n}$以及它们的合成逆使用分解的$\displaystyle{\frac{\mathbb{F}_q[x]}{\left\langle x^n -1 \right\rangle}}$基于其本原幂等元。作为结果,对合的直接构造。

英文摘要:

The use of permutation polynomials has appeared, along to their compositional inverses, as a good choice in the implementation of cryptographic systems. Hence, there has been a demand for constructions of these polynomials which coefficients belong to a finite field. As a particular case of permutation polynomial, involution is highly desired since its compositional inverse is itself. In this work, we present an effective way of how to construct several linear permutation polynomials over $\mathbb{F}_{q^n}$ as well as their compositional inverses using a decomposition of $\displaystyle{\frac{\mathbb{F}_q[x]}{\left\langle x^n -1 \right\rangle}}$ based on its primitive idempotents. As a consequence, an immediate construction of involutions is presented.

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

↑