当前位置: X-MOL 学术ACM Trans. Internet Technol. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Fast Search of Lightweight Block Cipher Primitives via Swarm-like Metaheuristics for Cyber Security
ACM Transactions on Internet Technology ( IF 5.3 ) Pub Date : 2021-07-16 , DOI: 10.1145/3417296
Xin Jin 1 , Yuwei Duan 2 , Ying Zhang 2 , Yating Huang 2 , Mengdong Li 2 , Ming Mao 2 , Amit Kumar Singh 3 , Yujie Li 4
Affiliation  

With the construction and improvement of 5G infrastructure, more devices choose to access the Internet to achieve some functions. People are paying more attention to information security in the use of network devices. This makes lightweight block ciphers become a hotspot. A lightweight block cipher with superior performance can ensure the security of information while reducing the consumption of device resources. Traditional optimization tools, such as brute force or random search, are often used to solve the design of Symmetric-Key primitives. The metaheuristic algorithm was first used to solve the design of Symmetric-Key primitives of SKINNY. The genetic algorithm and the simulated annealing algorithm are used to increase the number of active S-boxes in SKINNY, thus improving the security of SKINNY. Based on this, to improve search efficiency and optimize search results, we design a novel metaheuristic algorithm, named particle swarm-like normal optimization algorithm (PSNO) to design the Symmetric-Key primitives of SKINNY. With our algorithm, one or better algorithm components can be obtained more quickly. The results in the experiments show that our search results are better than those of the genetic algorithm and the simulated annealing algorithm. The search efficiency is significantly improved. The algorithm we proposed can be generalized to the design of Symmetric-Key primitives of other lightweight block ciphers with clear evaluation indicators, where the corresponding indicators can be used as the objective functions.

中文翻译:

通过类似 Swarm 的元启发式算法快速搜索轻量级块密码原语以实现网络安全

随着5G基础设施的建设和完善,更多的设备选择接入互联网来实现一些功能。人们在使用网络设备时更加关注信息安全。这使得轻量级分组密码成为热点。性能优越的轻量级分组密码可以在保证信息安全的同时减少设备资源的消耗。传统的优化工具,例如蛮力或随机搜索,通常用于解决对称密钥原语的设计。元启发式算法首先用于解决 SKINNY 的 Symmetric-Key 原语的设计。采用遗传算法和模拟退火算法,增加了SKINNY中活跃S盒的数量,从而提高了SKINNY的安全性。基于此,为了提高搜索效率和优化搜索结果,我们设计了一种新的元启发式算法,称为粒子群法线优化算法(PSNO)来设计 SKINNY 的 Symmetric-Key 原语。使用我们的算法,可以更快地获得一个或更好的算法组件。实验结果表明,我们的搜索结果优于遗传算法和模拟退火算法。搜索效率显着提高。我们提出的算法可以推广到其他具有明确评估指标的轻量级分组密码的对称密钥原语的设计中,其中相应的指标可以作为目标函数。命名为类粒子群法线优化算法 (PSNO) 来设计 SKINNY 的 Symmetric-Key 原语。使用我们的算法,可以更快地获得一个或更好的算法组件。实验结果表明,我们的搜索结果优于遗传算法和模拟退火算法。搜索效率显着提高。我们提出的算法可以推广到其他具有明确评估指标的轻量级分组密码的对称密钥原语的设计中,其中相应的指标可以作为目标函数。命名为类粒子群法线优化算法 (PSNO) 来设计 SKINNY 的 Symmetric-Key 原语。使用我们的算法,可以更快地获得一个或更好的算法组件。实验结果表明,我们的搜索结果优于遗传算法和模拟退火算法。搜索效率显着提高。我们提出的算法可以推广到其他具有明确评估指标的轻量级分组密码的对称密钥原语的设计中,其中相应的指标可以作为目标函数。实验结果表明,我们的搜索结果优于遗传算法和模拟退火算法。搜索效率显着提高。我们提出的算法可以推广到其他具有明确评估指标的轻量级分组密码的对称密钥原语的设计中,其中相应的指标可以作为目标函数。实验结果表明,我们的搜索结果优于遗传算法和模拟退火算法。搜索效率显着提高。我们提出的算法可以推广到其他具有明确评估指标的轻量级分组密码的对称密钥原语的设计中,其中相应的指标可以作为目标函数。
更新日期:2021-07-16
down
wechat
bug