Alexandr Kuznetsov , Serhii Kandii , Emanuele Frontoni , Nikolay Poluyanenko
{"title":"SBGen: A high-performance library for rapid generation of cryptographic S-boxes","authors":"Alexandr Kuznetsov , Serhii Kandii , Emanuele Frontoni , Nikolay Poluyanenko","doi":"10.1016/j.softx.2024.101788","DOIUrl":null,"url":null,"abstract":"<div><p>In the realm of cryptographic research, the generation of S-boxes with high nonlinearity and optimal cryptographic properties remains a critical challenge. This paper presents a novel approach to S-box generation, leveraging the strengths of heuristic optimization methods. Through a meticulous integration of Simulated Annealing (SA) and Hill Climbing (HC) algorithms with sophisticated cost functions, we introduce an innovative software tool that significantly advances the efficiency of generating highly nonlinear S-boxes. Our methodology is distinguished by its ability to consistently produce S-boxes that meet stringent security criteria, with a remarkable 100 % success rate and minimized computational overhead. A comparative analysis reveals that our approach outperforms existing methods in terms of the probability of generating target S-boxes and the average number of iterations required. The software's practical implications extend beyond theoretical advancements, offering a valuable resource for cryptographic system designers in their quest to fortify cipher systems against linear and differential cryptanalysis. By setting new benchmarks for nonlinearity and search efficiency, our work paves the way for future research in cryptographic S-box generation, highlighting the potential of combining heuristic techniques with domain-specific cost functions to achieve superior security outcomes.</p></div>","PeriodicalId":21905,"journal":{"name":"SoftwareX","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2352711024001596/pdfft?md5=f36b1b34b48fbdcc4276debf5f9014a3&pid=1-s2.0-S2352711024001596-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SoftwareX","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352711024001596","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
In the realm of cryptographic research, the generation of S-boxes with high nonlinearity and optimal cryptographic properties remains a critical challenge. This paper presents a novel approach to S-box generation, leveraging the strengths of heuristic optimization methods. Through a meticulous integration of Simulated Annealing (SA) and Hill Climbing (HC) algorithms with sophisticated cost functions, we introduce an innovative software tool that significantly advances the efficiency of generating highly nonlinear S-boxes. Our methodology is distinguished by its ability to consistently produce S-boxes that meet stringent security criteria, with a remarkable 100 % success rate and minimized computational overhead. A comparative analysis reveals that our approach outperforms existing methods in terms of the probability of generating target S-boxes and the average number of iterations required. The software's practical implications extend beyond theoretical advancements, offering a valuable resource for cryptographic system designers in their quest to fortify cipher systems against linear and differential cryptanalysis. By setting new benchmarks for nonlinearity and search efficiency, our work paves the way for future research in cryptographic S-box generation, highlighting the potential of combining heuristic techniques with domain-specific cost functions to achieve superior security outcomes.
期刊介绍:
SoftwareX aims to acknowledge the impact of software on today''s research practice, and on new scientific discoveries in almost all research domains. SoftwareX also aims to stress the importance of the software developers who are, in part, responsible for this impact. To this end, SoftwareX aims to support publication of research software in such a way that: The software is given a stamp of scientific relevance, and provided with a peer-reviewed recognition of scientific impact; The software developers are given the credits they deserve; The software is citable, allowing traditional metrics of scientific excellence to apply; The academic career paths of software developers are supported rather than hindered; The software is publicly available for inspection, validation, and re-use. Above all, SoftwareX aims to inform researchers about software applications, tools and libraries with a (proven) potential to impact the process of scientific discovery in various domains. The journal is multidisciplinary and accepts submissions from within and across subject domains such as those represented within the broad thematic areas below: Mathematical and Physical Sciences; Environmental Sciences; Medical and Biological Sciences; Humanities, Arts and Social Sciences. Originating from these broad thematic areas, the journal also welcomes submissions of software that works in cross cutting thematic areas, such as citizen science, cybersecurity, digital economy, energy, global resource stewardship, health and wellbeing, etcetera. SoftwareX specifically aims to accept submissions representing domain-independent software that may impact more than one research domain.