One Property to Rule Them All? On the Limits of Trade-Offs for S-Boxes
Created by W.Langdon from
gp-bibliography.bib Revision:1.7970
- @InProceedings{Djurasevic:2020:GECCO,
-
author = "Marko Djurasevic and Domagoj Jakobovic and
Stjepan Picek",
-
title = "One Property to Rule Them All? On the Limits of
Trade-Offs for {S}-Boxes",
-
year = "2020",
-
editor = "Carlos Artemio {Coello Coello} and
Arturo Hernandez Aguirre and Josu Ceberio Uribe and
Mario Garza Fabre and Gregorio {Toscano Pulido} and
Katya Rodriguez-Vazquez and Elizabeth Wanner and
Nadarajen Veerapen and Efren Mezura Montes and
Richard Allmendinger and Hugo Terashima Marin and
Markus Wagner and Thomas Bartz-Beielstein and Bogdan Filipic and
Heike Trautmann and Ke Tang and John Koza and
Erik Goodman and William B. Langdon and Miguel Nicolau and
Christine Zarges and Vanessa Volz and Tea Tusar and
Boris Naujoks and Peter A. N. Bosman and
Darrell Whitley and Christine Solnon and Marde Helbig and
Stephane Doncieux and Dennis G. Wilson and
Francisco {Fernandez de Vega} and Luis Paquete and
Francisco Chicano and Bing Xue and Jaume Bacardit and
Sanaz Mostaghim and Jonathan Fieldsend and
Oliver Schuetze and Dirk Arnold and Gabriela Ochoa and
Carlos Segura and Carlos Cotta and Michael Emmerich and
Mengjie Zhang and Robin Purshouse and Tapabrata Ray and
Justyna Petke and Fuyuki Ishikawa and Johannes Lengler and
Frank Neumann",
-
isbn13 = "9781450371285",
-
publisher = "Association for Computing Machinery",
-
publisher_address = "New York, NY, USA",
-
URL = "https://doi.org/10.1145/3377930.3390247",
-
DOI = "doi:10.1145/3377930.3390247",
-
booktitle = "Proceedings of the 2020 Genetic and Evolutionary
Computation Conference",
-
pages = "1064--1072",
-
size = "9 pages",
-
keywords = "genetic algorithms, genetic programming, S-boxes,
cryptography, evolutionary algorithms, trade-off",
-
address = "internet",
-
series = "GECCO '20",
-
month = jul # " 8-12",
-
organisation = "SIGEVO",
-
abstract = "Substitution boxes (S-boxes) are nonlinear mappings
that represent one of the core parts of many
cryptographic algorithms (ciphers). If S-box does not
possess good properties, a cipher would be susceptible
to attacks. To design suitable S-boxes, we can use
heuristics as it allows significant freedom in the
selection of required cryptographic properties.
Unfortunately, with heuristics, one is seldom sure how
good a trade-off between cryptographic properties is
reached or if optimizing for one property optimizes
implicitly for another property. the most detailed
analysis of trade-offs among S-box cryptographic
properties. More precisely, we ask questions if one
property is optimized, what is the worst possible value
for some other property, and what happens if all
properties are optimized. Our results show that while
it is possible to reach a large variety of possible
solutions, optimizing for a certain property would
commonly result in good values for other properties. In
turn, this suggests that a single-objective approach
should be a method of choice unless some precise values
for multiple properties are needed.",
-
notes = "Also known as \cite{10.1145/3377930.3390247}
GECCO-2020 A Recombination of the 29th International
Conference on Genetic Algorithms (ICGA) and the 25th
Annual Genetic Programming Conference (GP)",
- }
Genetic Programming entries for
Marko Durasevic
Domagoj Jakobovic
Stjepan Picek
Citations