密码学中S盒适应度景观的一个刻画
A characterisation of S-box fitness landscapes in cryptography
摘要：
替换盒（S盒）是密码算法设计中经常使用的非线性对象。高质量S盒的设计是一个有趣的问题，吸引了很多的关注。近年来，许多人尝试使用几何学来设计S盒，但结果往往与以前已知的最佳结果相去甚远。不幸的是，大部分的努力都是在探索不同的算法和适应度函数，而很少有人注意到为什么这个问题对数学家来说如此困难。在本文中，我们进行了适应度景观分析，以更好地理解为什么这个问题可能很难。除此之外，我们发现，几乎每个初始起点都有自己的局部最优，即使网络是高度互连的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
