The design of S-boxes by simulated annealing

J A Clark; J L Jacob; S Stepney

doi:10.1109/CEC.2004.1331078

The design of S-boxes by simulated annealing

J A Clark, J L Jacob, S Stepney

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been 14 proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task; several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.

Original language	English
Pages (from-to)	219-231
Number of pages	13
Journal	New Generation Computing
Volume	23
Issue number	3
DOIs	https://doi.org/10.1109/CEC.2004.1331078
Publication status	Published - 2005

Bibliographical note

Query date: 14/01/2011

Keywords

cryptography
s-boxes
nonlinearity
autocorrelation
simulated annealing
BOOLEAN FUNCTIONS

Access to Document

10.1109/CEC.2004.1331078

http://dx.doi.org/10.1109/CEC.2004.1331078

Cite this

@article{de8a838425df4b859fd0a45ece417f84,

title = "The design of S-boxes by simulated annealing",

abstract = "Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been 14 proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task; several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.",

keywords = "cryptography, s-boxes, nonlinearity, autocorrelation, simulated annealing, BOOLEAN FUNCTIONS",

author = "Clark, {J A} and Jacob, {J L} and S Stepney",

note = "Query date: 14/01/2011",

year = "2005",

doi = "10.1109/CEC.2004.1331078",

language = "English",

volume = "23",

pages = "219--231",

journal = "New Generation Computing",

issn = "0288-3635",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - The design of S-boxes by simulated annealing

AU - Clark, J A

AU - Jacob, J L

AU - Stepney, S

N1 - Query date: 14/01/2011

PY - 2005

Y1 - 2005

N2 - Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been 14 proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task; several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.

AB - Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been 14 proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task; several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.

KW - cryptography

KW - s-boxes

KW - nonlinearity

KW - autocorrelation

KW - simulated annealing

KW - BOOLEAN FUNCTIONS

U2 - 10.1109/CEC.2004.1331078

DO - 10.1109/CEC.2004.1331078

M3 - Article

SN - 0288-3635

VL - 23

SP - 219

EP - 231

JO - New Generation Computing

JF - New Generation Computing

IS - 3

ER -