Title | Differentially 4-Uniform Permutations with the Best Known Nonlinearity from Butterflies |
---|---|

Booktitle | IACR Trans. Symmetric Cryptol. |

Volume | 2017, Issue 2 |

Pages | 228-249 |

Year | 2017 |

URL | https://tosc.iacr.org/index.php/ToSC/article/view/645 |

DOI | 10.13154/tosc.v2017.i2.228-249 (link) |

Author | Shihui Fu (Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences) |

Author | Xiutao Feng (Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences) |

Author | Baofeng Wu (State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences) |

Abstract | Many block ciphers use permutations defined over the finite field F22k with low differential uniformity, high nonlinearity, and high algebraic degree to provide confusion. Due to the lack of knowledge about the existence of almost perfect nonlinear (APN) permutations over F22k, which have lowest possible differential uniformity, when k > 3, constructions of differentially 4-uniform permutations are usually considered. However, it is also very difficult to construct such permutations together with high nonlinearity; there are very few known families of such functions, which can have the best known nonlinearity and a high algebraic degree. At Crypto’16, Perrin et al. introduced a structure named butterfly, which leads to permutations over F22k with differential uniformity at most 4 and very high algebraic degree when k is odd. It is posed as an open problem in Perrin et al.’s paper and solved by Canteaut et al. that the nonlinearity is equal to 22k−1−2k. In this paper, we extend Perrin et al.’s work and study the functions constructed from butterflies with exponent e = 2i + 1. It turns out that these functions over F22k with odd k have differential uniformity at most 4 and algebraic degree k +1. Moreover, we prove that for any integer i and odd k such that gcd(i, k) = 1, the nonlinearity equality holds, which also gives another solution to the open problem proposed by Perrin et al. This greatly expands the list of differentially 4-uniform permutations with good nonlinearity and hence provides more candidates for the design of block ciphers. |

@article{tosc-2017-28464, title={Differentially 4-Uniform Permutations with the Best Known Nonlinearity from Butterflies}, journal={IACR Trans. Symmetric Cryptol.}, publisher={Ruhr-Universität Bochum}, volume={2017, Issue 2}, pages={228-249}, url={https://tosc.iacr.org/index.php/ToSC/article/view/645}, doi={10.13154/tosc.v2017.i2.228-249}, author={Shihui Fu and Xiutao Feng and Baofeng Wu}, year=2017 }