数学
排列(音乐)
构造(python库)
密码学
有限域
纯数学
组合数学
离散数学
域代数上的
算法
计算机科学
物理
声学
程序设计语言
标识
DOI:10.1142/s0219498822502206
摘要
The use of permutation polynomials over finite fields has appeared, along with their compositional inverses, as a good choice in the implementation of cryptographic systems. As a particular case, the construction of involutions is highly desired since their compositional inverses are themselves. In this work, we present an effective way of how to construct several linear permutation polynomials over [Formula: see text] as well as their compositional inverses using a decomposition of [Formula: see text] based on its primitive idempotents. As a consequence, involutions are also constructed.
科研通智能强力驱动
Strongly Powered by AbleSci AI