信息网络安全 ›› 2022, Vol. 22 ›› Issue (8): 8-18.doi: 10.3969/j.issn.1671-1122.2022.08.002

• 技术研究 • 上一篇    下一篇

基于混沌和改进广义Feistel结构的轻量级密码算法

佟晓筠1, 苏煜粤1(), 张淼1, 王翥2   

  1. 1.哈尔滨工业大学(威海)计算机科学与技术学院,威海 264209
    2.哈尔滨工业大学(威海)信息科学与工程学院,威海 264209
  • 收稿日期:2022-04-15 出版日期:2022-08-10 发布日期:2022-09-15
  • 通讯作者: 苏煜粤 E-mail:suyuyue2000@163.com
  • 作者简介:佟晓筠(1963—),女,辽宁,教授,博士,主要研究方向为信息安全|苏煜粤(2000—),女,江西,硕士研究生,主要研究方向为信息安全和混沌密码学。|张淼(1979—),女,内蒙古,教授,博士,主要研究方向为混沌密码学|王翥(1963—),男,辽宁,教授,博士,主要研究方向为无线传感网络与安全
  • 基金资助:
    国家自然科学基金(61902091);山东省自然科学基金(ZR2019MF054)

Lightweight Cipher Algorithm Based on Chaos and Improved Generalized Feistel Structure

TONG Xiaojun1, SU Yuyue1(), ZHANG Miao1, WANG Zhu2   

  1. 1. Department of Computer Science and Technology, Harbin Institute of Technology at Weihai, Weihai 264209, China
    2. Department of Information science and Engineering, Harbin Institute of Technology at Weihai, Weihai 264209, China
  • Received:2022-04-15 Online:2022-08-10 Published:2022-09-15
  • Contact: SU Yuyue E-mail:suyuyue2000@163.com

摘要:

随着物联网的快速发展,无线网络传感器、射频识别标签以及工业控制器等被广泛部署,这些资源受限设备的安全同样需要保障,而传统的密码算法需要消耗大量的资源,不适用于资源受限设备。针对以上问题,文章提出一种轻量级分组密码。S盒是分组密码的关键性组件,通过应用两个混沌映射和跳跃蜘蛛优化算法构成的多目标优化算法生成并优化得到非线性度平均值为110,线性逼近概率为0.1172,差分逼近概率为0.0391的S盒。文章对广义Feistel结构进行相应改进,改进后的结构一次能够处理所有的中间状态,不存在未处理的分支,并结合构造的S盒、密钥扩展算法等,组成分组长度为64位、种子密钥长度为80位、迭代轮数为12轮的轻量级分组密码算法。该算法的等效门电路数量符合轻量级的标准,并且有良好的性能。

关键词: 轻量级分组密码, S盒, 广义Feistel结构, 混沌映射, 跳跃蜘蛛优化算法

Abstract:

With the rapid development of the Internet of Things, wireless network sensors, radio frequency identification tags, and industrial controllers are widely deployed. The security of these limited devices also needs to be guaranteed, and the traditional cryptographic algorithm needs to consume a lot of resources. To solve these problems, a new lightweight block cipher was proposed. S-box was a key component in block cipher. By applying two chaotic map, a S-box with average nonlinearity of 110, linear approximation probability of 0.1172 and differential approximation probability of 0.0391 was obtained. The generalized Feistel structure was correspondingly improved and the improved structure could handle all intermediate states at one time without unprocessed branches. Combined with the constructed S-box, the improved structure and key expansion algorithm, a new lightweight block cipher algorithm with a packet length of 64 bit, a seed key length of 80 bit and 12 iteration rounds was formed. The algorithm has good performance and the gate equivalent number of that meets the lightweight standard.

Key words: lightweight block cipher, S-box, generalized Feistel structure, chaotic map, jumping spiders optimization algorithm

中图分类号: