Designing substitution boxes for secure ciphers. (26th April 2007)

• Record Type: Journal Article
• Authors: Nedjah, Nadia; Mourelle, Luiza de Macedo
• Is Part Of: International journal of innovative computing and applications. Volume 1:Number 1(2007)
• Page Start: 86
• Page End: 91
• Publication Date: 2007-04-26
• Subjects: substitution boxes -- S-box -- Nash equilibrium -- symmetric key algorithms -- cryptography -- secure ciphers -- substitution box design -- evolutionary computing -- genetic algorithms; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

Abstract

In cryptography, a Substitution box (S-box) constitutes a cornerstone component of symmetric key algorithms. In block ciphers, they are typically used to obscure the relationship between the plaintext and the ciphertext. It is well-known that the more linear and the less auto-correlated the S-box is, the more resilient the cryptosystem that uses them. However, engineering a regular S-box that has the highest non-linearity and lowest auto-correlation properties is an NP-complete problem. In this paper, we exploit evolutionary computation to engineer regular S-boxes that present high non-linearity and low auto-correlation properties.