Cryptographically Strong S-Boxes Based on Cellular Automata

  • Authors:
  • Miroslaw Szaban;Franciszek Seredynski

  • Affiliations:
  • Institute of Computer Science, University of Podlasie, Siedlce, Poland 08-110;Polish-Japanese Institute of Information Technology, Warsaw, Poland 02-008

  • Venue:
  • ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Substitution boxes (S-boxes) are the main elements of block ciphers, wide used in modern cryptography. In this paper we propose a new method to create S-boxes, which is based on application of Cellular Automata (CA). We present results of testing CA-based S-boxes, which confirm that CA are able to realize efficiently Boolean functions corresponding to classical S-boxes. Proposed CA-based S-boxes offer cryptographic properties comparable or better than classical S-box tables.