Abstract
Let Fq be the finite field with q elements and let f be a permutation polynomial over Fq. Let Sq denote the symmetric group on Fq. In this paper, we mainly investigate some characterizations on the elements f∈ Sq of order 3, i.e., f∘ f∘ f= I, where f is also called a triple-cycle permutation in the literature. Some explicit triple-cycle permutations are constructed.
| Original language | English |
|---|---|
| Pages (from-to) | 2119-2132 |
| Number of pages | 14 |
| Journal | Designs, Codes, and Cryptography |
| Volume | 88 |
| Issue number | 10 |
| DOIs | |
| State | Published - 1 Oct 2020 |
Keywords
- Block cipher
- Finite field
- Permutation polynomial
- Triple-cycle permutation
Fingerprint
Dive into the research topics of 'Characterizations and constructions of triple-cycle permutations of the form xrh(xs)'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver