Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings (Q1803559): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings |
scientific article |
Statements
Cryptanalysis of Rédei- and Dickson permutations on arbitrary finite rings (English)
0 references
29 June 1993
0 references
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.
0 references
Rédei permutations
0 references
Dickson polynomial
0 references
Rédei function
0 references
cycle length
0 references
group structure
0 references
number of fixed points
0 references
Dickson permutations
0 references
finite commutative rings with identity
0 references
public-key cryptosystems
0 references
