A classification of S-boxes generated by Orthogonal Cellular Automata
A classification of S-boxes generated by Orthogonal Cellular Automata
Abstract Most of the approaches published in the literature to construct S-boxes via Cellular Automata (CA) work by either iterating a finite CA for several time steps, or by a one-shot application of the global rule. The main characteristic that brings together these works is that they employ a single …