Linear permutations and their compositional inverses over 𝔽qn
Keyword(s):
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.
1969 ◽
Vol 7
(1)
◽
pp. 49-55
◽
2015 ◽
Vol 31
◽
pp. 228-240
◽
2019 ◽
Vol 19
(04)
◽
pp. 2050067
2012 ◽
Vol 18
(6)
◽
pp. 1184-1194
◽
2016 ◽
Vol 83
(2)
◽
pp. 425-443
◽
2017 ◽
Vol 45
◽
pp. 422-427
◽
2013 ◽
Vol 22
◽
pp. 16-23
◽