Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
How to Improve the Nonlinearity of Bijective S-Boxes
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
Two-Stage Optimisation in the Design of Boolean Functions
ACISP '00 Proceedings of the 5th 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
Evolving Boolean Functions Satisfying Multiple Criteria
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Fast S-box security mechanism research based on the polymorphic cipher
Information Sciences: an International Journal
Designing substitution boxes for secure ciphers
International Journal of Innovative Computing and Applications
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
Evolutionary design of resilient substitution boxes: from coding to hardware implementation
ICES'07 Proceedings of the 7th international conference on Evolvable systems: from biology to hardware
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
Cryptanalysis of four-rounded DES using binary artificial immune system
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
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 |
Substitution boxes (S-boxes) are important components in many modern-day symmetric key ciphers. Their study has attracted a great deal of attention over many years. The emergence of a variety of cryptosystem attacks has shown that substitutions must be designed with great care. Some general criteria such as high non-linearity and low autocorrelation have been proposed (providing some protection against attacks such as linear cryptanalysis and differential cryptanalysis). The design of appropriate S-boxes is a difficult task: several criteria must be traded off and the design space is huge. There has been little application of evolutionary search to the development of S-boxes. In this paper we show how a cost function that has found excellent single-output Boolean functions can be generalised to provide improved results for small S-boxes.