有限域上的幂零线性化多项式及其应用
Nilpotent linearized polynomials over finite fields and applications
摘要:
设$q$是素幂,$\mathbb F_{q^n}$是具有$q^n$元素的有限域,其中$n>1$ .我们引入了一类$\mathbb F_{q^n}$上的线性化多项式$L(x)$,使得对于某些$t\ge 2$,$$L^{(t)}(x):=\underbrace{L(L(\cdots(x)\cdots))}_{t \quad\text{times}}\equiv 0\pmod {x^{q^n}-x}$$,称为幂零线性化多项式(NLP).我们讨论的存在性和建设的NLP的,作为一个应用程序,我们展示了如何构建置换的$\mathbb F_{q^n}$从这些多项式。对于其中一些排列,我们可以明确地给出组成逆映射和循环结构。本文还提出了一种构造无不动点的二元域上对合的方法,这种方法在分组密码中很有用。
英文摘要:
Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that $$L^{(t)}(x):=\underbrace{L(L(\cdots(x)\cdots))}_{t \quad\text{times}}\equiv 0\pmod {x^{q^n}-x}$$ for some $t\ge 2$, called nilpotent linearized polynomials (NLP's). We discuss the existence and construction of NLP's and, as an application, we show how to construct permutations of $\mathbb F_{q^n}$ from these polynomials. For some of those permutations, we can explicitly give the compositional inverse map and the cycle structure. This paper also contains a method for constructing involutions over binary fields with no fixed points, which are useful in block ciphers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。