期刊
PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19)
卷 -, 期 -, 页码 285-293出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3321707.3321850
关键词
Security; substitution boxes; landscape analysis; local area networks
资金
- Australian Research Council [DE160100850]
- COST (European Cooperation in Science and Technology) [CA15140]
- Australian Research Council [DE160100850] Funding Source: Australian Research Council
Substitution Boxes (S-boxes) are nonlinear objects often used in the design of cryptographic algorithms. The design of high quality S-boxes is an interesting problem that attracts a lot of attention. Many attempts have been made in recent years to use heuristics to design S-boxes, but the results were often far from the previously known best obtained ones. Unfortunately, most of the effort went into exploring different algorithms and fitness functions while little attention has been given to the understanding why this problem is so difficult for heuristics. In this paper, we conduct a fitness landscape analysis to better understand why this problem can be difficult. Among other, we find that almost each initial starting point has its own local optimum, even though the networks are highly interconnected.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据