《计算机应用》唯一官方网站 ›› 2022, Vol. 42 ›› Issue (9): 2750-2756.DOI: 10.11772/j.issn.1001-9081.2021081382

• 网络空间安全 • 上一篇    

基于GPU的密码S盒代数性质评估方法

蔡婧雯1, 韦永壮1(), 刘争红2   

  1. 1.广西密码学与信息安全重点实验室(桂林电子科技大学), 广西 桂林 541004
    2.广西无线宽带通信与信号处理重点实验室(桂林电子科技大学), 广西 桂林 541004
  • 收稿日期:2021-08-03 修回日期:2021-11-20 接受日期:2021-11-21 发布日期:2022-01-07 出版日期:2022-09-10
  • 通讯作者: 韦永壮
  • 作者简介:蔡婧雯(1997—),女,广东东莞人,硕士研究生,主要研究方向:分组密码算法、GPU并行计算;
    刘争红(1979—),男,湖北红安人,高级实验师,硕士,主要研究方向:无线宽带通信、FPGA、GPU并行计算。
  • 基金资助:
    国家自然科学基金资助项目(61872103);广西自然科学基金资助项目(2019GXNSFGA245004)

GPU-based method for evaluating algebraic properties of cryptographic S-boxes

Jingwen CAI1, Yongzhuang WEI1(), Zhenghong LIU2   

  1. 1.Guangxi Key Laboratory of Cryptography and Information Security(Guilin University of Electronic Technology),Guilin Guangxi 541004,China
    2.Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing(Guilin University of Electronic Technology),Guilin Guangxi 541004,China
  • Received:2021-08-03 Revised:2021-11-20 Accepted:2021-11-21 Online:2022-01-07 Published:2022-09-10
  • Contact: Yongzhuang WEI
  • About author:CAI Jingwen, born in 1997, M. S. candidate. Her research interests include block cipher algorithm, GPU parallel computing.
    LIU Zhenghong, born in 1979, M. S., senior experimentalist. His research interests include wireless broadband communications, FPGA, GPU parallel computing.
  • Supported by:
    National Natural Science Foundation of China(61872103);Natural Science Foundation of Guangxi(2019GXNSFGA245004)

摘要:

密码S盒即黑盒,作为对称密码算法中的非线性部件,其代数性质往往决定着密码算法的安全性能。差分均匀度、非线性度及透明阶作为衡量密码S盒安全性质的三个基本指标,分别刻画了S盒抵御差分密码分析、线性密码分析及差分功耗攻击的能力。当密码S盒输入尺寸较大(如S盒输入长度大于15比特)时在中央处理器(CPU)中的求解所需时间仍过长,甚至求解不可行。如何针对大尺寸输入密码S盒的代数性质进行快速评估是目前业界的研究热点。基于图形处理器(GPU)提出一种快速评估密码S盒代数性质的方法。该方法利用切片技术将内核函数拆分至多线程,并结合求解差分均匀度、非线性度及透明阶的特征提出优化方案,从而实现并行计算。测试结果表明,与基于CPU的实现环境相比,基于单块GPU的环境下的实现效率得到了显著的提升。具体来说,计算差分均匀度、非线性度及透明阶所花时间分别节省了90.28%、78.57%、60%,验证了该方法的有效性。

关键词: 对称密码算法, 密码S盒, 图形处理器, 并行计算, 差分均匀度, 非线性度, 透明阶

Abstract:

Cryptographic S-boxes (or black boxes) are nonlinear components in symmetric encryption algorithms, and their algebraic properties usually determine the security performance of these encryption algorithms. Differential uniformity, nonlinearity and revised transparency order are three basic indicators to evaluate the security properties of cryptographic S-boxes. They describe the S-box’s ability against differential cryptanalysis, linear cryptanalysis and differential power attack respectively. When the input size of the cryptographic S-box is large (for example, the input length of the S-box is larger than 15 bits), the needed solving time in Central Processing Unit (CPU) is still too long, or even the solution is impracticable. How to evaluate the algebraic properties of the large-size S-box quickly is currently a research hot point in the field. Therefore, a method to evaluate the algebraic properties of cryptographic S-boxes quickly was proposed on the basis of Graphics Processing Unit (GPU). In this method, the kernel functions were split into multiple threads by slicing technique, and an optimization scheme was proposed by combining the characteristics of solving differential uniformity, nonlinearity and revised transparency order to realize parallel computing. Experimental results show that compared with CPU-based implementation environment, single GPU based environment has the implementation efficiency significantly improved. Specifically, the time spent on calculating differential uniformity, nonlinearity, and revised transparency order is saved by 90.28%, 80%, and 66.67% respectively, which verifies the effectiveness of this method.

Key words: symmetric encryption algorithm, cryptographic S-box, Graphics Processing Unit (GPU), parallel computing, differential uniformity, nonlinearity, revised transparency order

中图分类号: