Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings
The author establishes results on the group structure, the number of fixed points, and the cycle lengths of Rédei and Dickson permutations on arbitrary finite commutative rings with identity. This extends earlier work on such permutations for finite fields and residue class rings of the integers. The implications of these results for public-key cryptosystems based on Rédei and Dickson permutations are discussed in the last section.
scientific article; zbMATH DE number 221183
scientific article