Name
Abstract | ||
|---|---|---|
Differential uniformity of permutation polynomials has been studied intensively in recent years due to the differential cryptanalysis of S-boxes. The boomerang attack is a variant of differential cryptanalysis which combines two differentials for the upper part and the lower part of the block cipher. The boomerang uniformity measures the resistance of block ciphers to the boomerang attack. In this paper, by using the resultant elimination method, we study the boomerang uniformity of normalized permutation polynomials of the low degree over finite fields. As a result, we determine the boomerang uniformity of all normalized permutation polynomials of degree up to six over the finite field $${\mathbb {F}}_{q}$$. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00200-020-00431-1 | Applicable Algebra in Engineering, Communication and Computing |
Keywords | DocType | Volume |
Finite field, Permutation polynomial, Normalized polynomial, Boomerang uniformity, Resultant elimination, 12Y05, 11T99 | Journal | 31 |
Issue | ISSN | Citations |
3 | 0938-1279 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| YanPing Wang | 1 | 48 | 19.44 |
| Qiang Wang | 2 | 237 | 37.93 |
| WeiGuo Zhang | 3 | 56 | 6.14 |