Back to Search
Start Over
New Results About the Boomerang Uniformity of Permutation Polynomials.
- Source :
- IEEE Transactions on Information Theory; Nov2019, Vol. 65 Issue 11, p7542-7553, 12p
- Publication Year :
- 2019
-
Abstract
- In EUROCRYPT 2018, Cid et al. introduced a new concept on the cryptographic property of S-boxes: boomerang connectivity table (BCT for short) for evaluating the subtleties of boomerang-style attacks. Very recently, BCT and the boomerang uniformity, the maximum value in BCT, were further studied by Boura and Canteaut. In this paper, aiming at providing new insights, we show some new results about BCT and the boomerang uniformity of permutations in terms of theory and experiment. First, we present an equivalent technique to compute BCT and the boomerang uniformity, which seems to be much simpler than the original definition by Cid et al. Second, thanks to Carlet’s idea, we give a characterization of functions $f$ from $ {\mathbb F}_{2}^{n}$ to itself with boomerang uniformity $\delta _{f}$ by means of the Walsh transform. Third, by our method, we consider boomerang uniformities of some specific permutations, mainly the ones with low differential uniformity. Finally, we obtain another class of 4-uniform BCT permutation polynomials over $ {\mathbb F}_{2^{n}}$. [ABSTRACT FROM AUTHOR]
- Subjects :
- PERMUTATIONS
UNIFORMITY
POLYNOMIALS
FINITE fields
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 65
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 139229529
- Full Text :
- https://doi.org/10.1109/TIT.2019.2918531