Application of cellular automata to create S-box functions

Substitution boxes (S-boxes) play very important role in cryptography. In this paper we propose a new method based on applying Cellular Automata (CA) to create S-boxes. We present preliminary results suggesting that CA are able to realize a function of classical S-boxes. It was shown that proposed CA fulfills a number of creation conditions necessary to play a role of S-box table. Proposed CA offer a solution which produces result comparable with classical S-boxes.