[Resource Topic] 2018/103: Decomposition of Permutations in a Finite Field

Welcome to the resource topic for 2018/103

Decomposition of Permutations in a Finite Field

Authors: Svetla Nikova, Ventzislav Nikov, Vincent Rijmen


We describe a method to decompose any power permutation, as a sequence of power permutations of lower algebraic degree. As a result we obtain decompositions of the inversion in \mathrm{GF}(2^n) for small n from 3 up to 16, as well as for the APN functions, when n=5. More precisely, we find decompositions into quadratic power permutations for any n not multiple of 4 and decompositions into cubic power permutations for n multiple of 4. Finally, we use the Theorem of Carlitz to prove that for 3 \leq n \leq 16 any n-bit permutation can be decomposed in quadratic and cubic permutations.

ePrint: https://eprint.iacr.org/2018/103

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .