arXiv · 1301.6972
Using evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity
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.
Explore related subjects
Keep this discovery
James McLaughlin, John A. Clark. 2013-01-29. Using evolutionary computation to create vectorial Boolean functions with low differential uniformity and high nonlinearity. https://arxiv.org/abs/1301.6972
Cite the original work for its findings. Save a collection to share your selection of sources.