Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers

[2407.03510] Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Cryptography and Security arXiv:2407.03510 (cs) [Submitted on 3 Jul 2024] Title: Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers Authors: Oleksandr Kuznetsov , Nikolay Poluyanenko , Emanuele Frontoni , Marco Arnesano , Oleksii Smirnov View a PDF of the paper titled Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers, by Oleksandr Kuznetsov and 4 other authors View PDF Abstract: This study explores the application of genetic algorithms in generating highly nonlinear substitution boxes (S-boxes) for symmetric key cryptography. We present a novel implementation that combines a genetic algorithm with the Walsh-Hadamard Spectrum (WHS) cost function to produce 8x8 S-boxes with a nonlinearity of 104. Our approach achieves performance parity with the best-known methods, requiring an average of 49,399 iterations with a 100% success rate. The study demonstrates significant improvements over earlier genetic algorithm implementations in this field, reducing iteration counts by orders of magnitude. By achieving equivalent performance through a different algorithmic approach, our work expands the toolkit available to cryptographers and highlights the potential of genetic methods in cryptographic primitive generation. The adaptability and parallelization potential of genetic algorithms suggest promising avenues for future research in S-box generation, potentially leading to more robust, efficient, and innovative cryptographic systems. Our findings contribute to the ongoing evolution of symmetric key cryptography, offering new perspectives on optimizing critical components of secure communication systems. Subjects: Cryptography and Security (cs.CR) Cite as: arXiv:2407.03510 [cs.CR] (or arXiv:2407.03510v1 [cs.CR] for this version) https://doi.org/10.48550/arXiv.2407.03510 Focus to learn more arXiv-issued DOI via DataCite Journal reference: CEUR Workshop Proceedings, 3829, 1--11, 2024 Submission history From: Oleksandr Kuznetsov [ view email ] [v1] Wed, 3 Jul 2024 21:15:24 UTC (559 KB) Full-text links: Access Paper: View a PDF of the paper titled Evolutionary Approach to S-box Generation: Optimizing Nonlinear Substitutions in Symmetric Ciphers, by Oleksandr Kuznetsov and 4 other authors View PDF view license Current browse context: cs.CR < prev | next > new | recent | 2024-07 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• A simple algorithm for fast correlation attacks on stream ciphers#292069
• A statistical test suite for random and pseudorandom number generators for cryptographic applications#6602
• A Tale of Cryptographic Encodings / Elena Micheli ; Gutachter: Sebastian Faust, Daniele Venturi#1065164
• Cryptanalytic Extraction of Neural Networks Without Known Architecture Assumption#1160729
• Encryption#2123