Cryptography with cellular automata
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Resistance of balanced s-boxes to linear and differential cryptanalysis
Information Processing Letters
A new kind of science
Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes
ICICS '99 Proceedings of the Second International Conference on Information and Communication Security
The design of S-boxes by simulated annealing
New Generation Computing - Evolutionary computation
Designing substitution boxes for secure ciphers
International Journal of Innovative Computing and Applications
Theory of Composing Non-linear Machines with Predictable Cyclic Structures
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Cryptographically Strong S-Boxes Based on Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Improving quality of DES S-boxes by cellular automata-based S-boxes
The Journal of Supercomputing
Dynamic cellular automata-based s-boxes
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
| Hi-index | 0.00 |
In the paper we use recently proposed cellular automata (CA) - based methodology [9] to design 6x4 S-boxes functionally equivalent to S-boxes used in current cryptographic standard known as DES. We provide an exhaustive experimental analysis of the proposed CA-based S-box in terms of non-linearity, autocorrelation, balance and strict avalanche criterion, and compare it with DES S-boxes. We show that the proposed CA-based S-box has cryptographic properties comparable or better than classical S-box tables. The interesting feature of the proposed S-box is a dynamic flexible structure fully functionally realized by CA, while the classical DES S-box is represented by predefined unchangeable table structure.