.png){kind=icon}
返回
Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2021.115305.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). The main feature of AAHC is the fact that the algorithm allows adaptive assignment of its population agents into cowards and heroes based on the exponential controlling functions. Furthermore, unlike its predecessor, AAHC also permits systematic manipulation of candidate solutions around the global best agent via the swap operator to boost its search intensification process. Meanwhile, to further enhance the diversification its solution, AHC also exploit the Tent map as the pseudo random generator replacement during its initial population initialization. Experimental results based on the generation of 8 x 8 substitution-box demonstrate that the proposed AAHC outperforms other competing metaheuristic algorithms in two main S-box criteria namely nonlinearity and strict avalanche criteria whilst maintaining commendable performances on bits independence criteria, differential approximation probability, linear approximation probability and transparency order.
Keyword:
Agent heroes and Cowards Algorithm
Substitution-box
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏ACUTE LARYNGOTRACHEOBRONCHITIS: ANALYSIS OF SIXTY-TWO CASES WITH REPORT OF AUTOPSIES IN EIGHT CASES
PREAI
分享收藏A novel method for designing S-box based on chaotic map and Teaching-Learning-Based Optimization一种基于混沌映射和教学优化的S盒设计方法
PREAI
分享收藏
查看更多内容