Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Practical genetic algorithms
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Introduction to Digital Systems
Introduction to Digital Systems
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
Differential Cryptanalysis of DES-like Cryptosystems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The First Experimental Cryptanalysis of the Data Encryption Standard
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The design of S-boxes by simulated annealing
New Generation Computing - Evolutionary computation
Explorations in Quantum Computing
Explorations in Quantum Computing
Designing hardware for finite synchronous state machines using quantum inspired evolution
International Journal of Innovative Computing and Applications
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
IEEE Transactions on Evolutionary Computation
Estimation of average switching activity in combinational logic circuits using symbolic simulation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
S-boxes constitute a cornerstone component in symmetric-key cryptographic algorithms, such as DES and AES encryption systems. In block ciphers, they are typically used to obscure the relationship between the plaintext and the ciphertext. Non-linear and non-correlated S-boxes are the most secure against linear and differential cryptanalysis. In this paper, we focus on a twofold objective: first, we evolve regular S-boxes with high non-linearity and low auto-correlation properties; then automatically generate evolvable hardware for the obtained S-box. Targeting the former, we use a quantum-inspired evolutionary algorithm to optimize regularity, non-linearity and auto-correlation, which constitute the three main desired properties in resilient S-boxes. Pursuing the latter, we exploit the same algorithm to automatically generate the evolvable hardware designs of substitution boxes that minimize hardware space and encryption/decryption time, which form the two main hardware characteristics. We compare our results against existing and well-known designs, which were produced by using conventional methods as well as through genetic algorithm. We will show that our approach provides higher quality S-boxes coding as well as circuits.