2000 character limit reached
Differentially low uniform permutations from known 4-uniform functions
Published 31 Oct 2019 in cs.IT and math.IT | (1910.14337v3)
Abstract: Functions with low differential uniformity can be used in a block cipher as S-boxes since they have good resistance to differential attacks. In this paper we consider piecewise constructions for permutations with low differential uniformity. In particular, we give two constructions of differentially 6-uniform functions, modifying the Gold function and the Bracken-Leander function on a subfield.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.