Designing cryptographically strong S-boxes with the use of cellular automata

Authors:
MirosłAw Szaban;Franciszek Seredynski
Affiliations:
Computer Science Department, The University of Podlasie, Sienkiewicza 51, 08-110 Siedlce, Poland;-
Venue:
Annales UMCS, Informatica
Year:
2008

Citing 6
Cited 0

Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A new kind of science

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
New cryptographic applications of boolean function equivalence classes

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

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