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
How to Improve the Nonlinearity of Bijective S-Boxes
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
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
| Hi-index | 0.00 |
In the paper we use recently proposed cellular automata (CA) - based methodology [9] to design 8 × n (n ≤ 8) S-boxes functionally equivalent to S-boxes used in current cryptographic standards. We provide an exhaustive experimental analysis of the proposed CAbased S-boxes in terms of non-linearity, autocorrelation and scalability, and compare results with other proposals. We show that the proposed CA-based S-boxes have cryptographic properties comparable or better than currently offered classical S-box tables.