Substitution Box Design Based on Chaotic Maps and Cuckoo Search Algorithm

Tanveer Akhtar, Nizamuddin, Jamal Uddin
{"title":"Substitution Box Design Based on Chaotic Maps and Cuckoo Search Algorithm","authors":"Tanveer Akhtar, Nizamuddin, Jamal Uddin","doi":"10.1109/COMMNET.2019.8742391","DOIUrl":null,"url":null,"abstract":"The widespread use of the Internet for transmission of data demands the well-defined data protection algorithms. Symmetric block cipher protects the digital information from the un-authorized recipient. The cryptographic strength of symmetric cipher mainly depends on substitution box (S-box). So the main challenge is to create an S-box with higher value of nonlinearity. Meta-heuristic optimization algorithm has been applied to create a secure S-box. In this paper, a design scheme based on chaotic maps and Cuckoo Search Algorithm (CSA) is proposed to enhance the non-linearity of S-box. Chaotic maps are widely used to create secure S-box due to their aperiodic nature. The proposed idea produced an S-box with non-linearity 109.25, which strengthens the cipher security against linear attacks. The results are compared with the recently created S-boxes and the S-boxes obtained using meta-heuristic algorithms such as Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Firefly algorithm (FA). The obtained S-box is evaluated against cryptographic criteria such as bijectivity, nonlinearity, strict avalanche criteria, bit independence criteria, linear probability and differential probability.","PeriodicalId":274754,"journal":{"name":"2019 International Conference on Advanced Communication Technologies and Networking (CommNet)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Advanced Communication Technologies and Networking (CommNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMMNET.2019.8742391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The widespread use of the Internet for transmission of data demands the well-defined data protection algorithms. Symmetric block cipher protects the digital information from the un-authorized recipient. The cryptographic strength of symmetric cipher mainly depends on substitution box (S-box). So the main challenge is to create an S-box with higher value of nonlinearity. Meta-heuristic optimization algorithm has been applied to create a secure S-box. In this paper, a design scheme based on chaotic maps and Cuckoo Search Algorithm (CSA) is proposed to enhance the non-linearity of S-box. Chaotic maps are widely used to create secure S-box due to their aperiodic nature. The proposed idea produced an S-box with non-linearity 109.25, which strengthens the cipher security against linear attacks. The results are compared with the recently created S-boxes and the S-boxes obtained using meta-heuristic algorithms such as Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Firefly algorithm (FA). The obtained S-box is evaluated against cryptographic criteria such as bijectivity, nonlinearity, strict avalanche criteria, bit independence criteria, linear probability and differential probability.
基于混沌映射和布谷鸟搜索算法的替换盒设计
互联网在数据传输中的广泛应用要求有定义良好的数据保护算法。对称分组密码保护数字信息不被未经授权的接收者获取。对称密码的密码强度主要取决于替换盒(S-box)。因此,主要的挑战是创建一个具有更高非线性值的s盒。应用元启发式优化算法创建了一个安全的s盒。本文提出了一种基于混沌映射和布谷鸟搜索算法(CSA)的设计方案来增强S-box的非线性。混沌映射由于其非周期性的特性,被广泛用于创建安全s盒。该思想产生了一个非线性为109.25的s盒,增强了密码对线性攻击的安全性。将结果与最近创建的s盒和使用蚁群优化(ACO)、遗传算法(GA)和萤火虫算法(FA)等元启发式算法得到的s盒进行了比较。根据双射性、非线性、严格雪崩准则、位无关准则、线性概率和微分概率等密码准则对得到的s盒进行评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信