Stjepan Picek
ABSTRACT
The design of cryptographically strong Substitution Boxes (S-boxes) is an interesting problem from both a cryptographic perspective as well as the combinatorial optimization one. Here we introduce the concept of evolving cellular automata rules that can be then translated into S-boxes. With it, we are able to find optimal S-boxes for sizes from 4 × 4 up to 7 × 7. As far as we know, this is the first time a heuristic approach is able to find optimal S-boxes for sizes larger than 4.
- Guido Bertoni, Joan Daemen, Michael Peeters, and Gilles Van Assche. 2011. The Keccak reference. (January 2011). http://keccak.noekeon.org/.Google Scholar
- Claude Carlet. 2010. Vectorial Boolean Functions for Cryptography. In Boolean Models and Methods in Mathematics, Computer Science, and Engineering (1st ed.), Yves Crania and Peter L. Hammer (Eds.). Cambridge University Press, New York, USA, 398--469.Google Scholar
- Lars R. Knudsen and Matthew Robshaw. 2011. The Block Cipher Companion. Springer. Google ScholarDigital Library
- Kaisa Nyberg. 1991. Perfect Nonlinear S-Boxes. In Advances in Cryptology - EUROCRYPT '91, Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, April 8--11, 1991, Proceedings (Lecture Notes in Computer Science), Vol. 547. Springer, 378--386. Google ScholarDigital Library
- Stjepan Picek, Marko Cupic, and Leon Rotim. 2016. A New Cost Function for Evolution of S-boxes. Evolutionary Computation (2016). Google ScholarDigital Library
- Riccardo Poli, William B. Langdon, and Nicholas Freitag McPhee. 2008. A field guide to genetic programming. Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk. (With contributions by J. R. Koza). Google ScholarDigital Library
Index Terms
- Evolving S-boxes based on cellular automata with genetic programming
Recommendations
Design of S-boxes Defined with Cellular Automata Rules
CF'17: Proceedings of the Computing Frontiers ConferenceThe aim of this paper is to find cellular automata (CA) rules that are used to describe S-boxes with good cryptographic properties and low implementation cost. Up to now, CA rules have been used in several ciphers to define an S-box, but in all those ...
Dynamic cellular automata-based s-boxes
EUROCAST'11: Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part IThe most important elements of many block ciphers are nonlinear functions known as substitution boxes (S-boxes). Classical S-boxes are usually represented by numerical tables, which are used today in current cryptographic standards, such as Data ...
Improving quality of DES S-boxes by cellular automata-based S-boxes
In the paper we use recently proposed cellular automata (CA) based methodology (Szaban and Seredynski in LNCS, vol. 5191, pp. 478---485, 2008) to design the 6 4 S-boxes functionally equivalent to S-boxes used in current cryptographic standard known as ...
Comments