2000 character limit reached
Using evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity
Published 29 Jan 2013 in cs.CR | (1301.6972v1)
Abstract: The two most important criteria for vectorial Boolean functions used as S-boxes in block ciphers are differential uniformity and nonlinearity. Previous work in this field has focused only on nonlinearity and a different criterion, autocorrelation. In this paper, we describe the results of experiments in using simulated annealing, memetic algorithms, and ant colony optimisation to create vectorial Boolean functions with low differential uniformity. Keywords: Metaheuristics, simulated annealing, memetic algorithms, ant colony optimization, cryptography, Boolean functions, vectorial Boolean functions.
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.