The design of s-boxes by simulated annealing

Abstract

Abstract-Substitution boxes are important components in many modern day block and stream ciphers. Their study has attracted a great deal of attention over many years. The development of a variety of cryptosystem attacks over the years has lead to the development of criteria for resilience to such attacks. Some general criteria such as high non-linearity and low autocorrelation have been proposed as useful criteria (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). 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.

Improving quality of DES S-boxes by cellular automata-based S-boxes

“…In this method, we construct a new Boolean function which can be defined as f β : B n → B 1 , and expressed by the formula f β ( [2,3,6,7]). The new function is a linear combination of k functions f i (x), i ≤ k, where β i ∈ B k .…”

A distributed approach inspired by membrane computing for optimizing bijective S-boxes

“…Though this is a pure random way, it will take great effort to find a good S-box [2,3] . Recently, the performance of evolutionary heuristics approaches, such as Hill Climbing, Genetic Algorithms and Simulated Annealing, on the design of strong regular S-boxes has been studied with very promising results [4][5][6] . The study of Genetic Algorithms (GA for short) and their application in a wide range of fields has fascinated a great number of researchers during the last decade.…”

LUT-Based QCA Implementation of a 4×4 S-Box

“…The S-Box idea has a firm hold in modern day cryptography. The new international symmetric key cryptography standard, the Advanced Encryption Standard (AES), also uses S-Boxes to perform substitutions [3].…”