We further study the boomerang uniformity of by using similar ideas and carrying out particular techniques in solving equations over finite fields.
Permutation polynomials with low differential uniformity are important candidate functions to design substitution boxes of block ciphers. In this paper, we ...
Oct 1, 2022 · In this paper, motivated by a recent work of Li, Xiong and Zeng (Li et al. (2021) [12]), we further study the boomerang uniformity of f c _ ( x ) ...
Boomerang uniformity four becomes actually optimal. To the best of our knowledge, currently over finite fields with even dimension (say F2n F22m) there are ...
On the boomerang uniformity of a class of permutation quadrinomials over finite fields. https://doi.org/10.1016/j.disc.2022.113000.
Jan 30, 2024 · An explicit class of permutation polynomials with boomerang uniformity at most 8 is given in Section 5. We conclude the paper in Section 6.
Missing: quadrinomials | Show results with:quadrinomials
May 20, 2020 · The following theorem provides new insights to study. Boomerang uniformity of permutations over finite fields with even characteristic [10] ...
Some quadratic permutation polynomials over finite fields. Rajesh P. Singh ... The Boomerang Uniformity of Three Classes of Permutation Polynomials over 𝔽2n.
Abstract The boomerang attack, introduced by Wagner in 1999, is a cryptanalysis technique against block ciphers based on differential cryptanalysis.
Missing: quadrinomials | Show results with:quadrinomials
We emphasize that our positive answer completely characterizes permutations with boomerang uniformity 4 from the butterfly structure.