Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Design of Rijndael
Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI
ACISP '01 Proceedings of the 6th 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
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The design of S-boxes by simulated annealing
New Generation Computing - Evolutionary computation
Cryptographically Strong S-Boxes Based on Cellular Automata
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Cellular Automata-Based S-Boxes vs. DES S-Boxes
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Designing cryptographically strong S-boxes with the use of cellular automata
Annales UMCS, Informatica
Properties of safe cellular automata-based S-boxes
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
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 cryptography, a Substitution box (S-box) constitutes a cornerstone component of symmetric key algorithms. In block ciphers, they are typically used to obscure the relationship between the plaintext and the ciphertext. It is well-known that the more linear and the less auto-correlated the S-box is, the more resilient the cryptosystem that uses them. However, engineering a regular S-box that has the highest non-linearity and lowest auto-correlation properties is an NP-complete problem. In this paper, we exploit evolutionary computation to engineer regular S-boxes that present high non-linearity and low auto-correlation properties.