Name
Abstract | ||
|---|---|---|
Any permutation polynomial is an n-cycle permutation. When n is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These permutations have important applications in cryptography and coding theory. Inspired by the AGW Criterion, we propose criteria for n-cycle permutations, which mainly are of the form xrh(xs). We then propose unified constructing methods including recursive ways and a cyclotomic way for n-cycle permutations of such form. We demonstrate our approaches by constructing three classes of explicit triple-cycle permutations with high index and two classes of n-cycle permutations with low index, many of which are new both at levels of permutation property and cycle property. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1016/j.ffa.2021.101847 | Finite Fields and Their Applications |
Keywords | DocType | Volume |
11T06 | Journal | 73 |
ISSN | Citations | PageRank |
1071-5797 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuting Chen | 1 | 1 | 0.36 |
| Liqi Wang | 2 | 1 | 0.36 |
| Shixin Zhu | 3 | 1 | 2.05 |