Optimal Design Method of 8 × 8 S-box Based on Multi-objective Genetic Algorithm
-
摘要:
混沌系统具有非线性、伪随机性、初始值敏感等特性,为基于动力系统构造性能良好的S盒提供了基础,进一步保证了分组加密算法安全性. 目前,基于混沌构造S盒的方法大多数针对单个性能指标进行优化,难以获得全面的性能提升. 针对此问题,结合混沌映射与多目标遗传算法,提出了一种新的S盒设计方法. 首先,利用混沌映射的特性产生初始S盒种群;然后,以S盒的非线性度和差分均匀性为优化目标,基于遗传算法框架对上述两指标进行优化. 针对S盒的特点,在优化算法中引入了交换操作,设计了新的变异操作以及非支配序集计算,有效提升了S盒的非线性度和差分均匀性. 实验结果表明该算法产生的S盒其差分均匀度为6,非线性度值至少为110,有效提升了S盒的综合性能.
Abstract:Chaotic systems have the characteristics of nonlinearity, pseudo-randomness and sensitivity to initial values, which provides an anchor to construct S-boxes based on dynamic system and secures block encryption algorithms. At present, most chaos-based S-box construction methods is designed to optimize single performance index, making it hard to improve the overall performance. To solve this, a new S-box design method is proposed by combining chaotic mapping and multi-objective genetic algorithm. Firstly, the initial S-box population is generated according to the characteristics of chaotic mapping; then, nonlinearity and difference uniformity of S-boxes are optimized under the framework of the genetic algorithm. According to the characteristics of the S-boxes, the exchange operation is introduced into the optimization algorithm, and a new mutation operation and calculation of non-dominated ordered sets are designed, effectively improving the nonlinearity and difference uniformity of the S-boxes. The experimental results show that the difference uniformity of the generated S-box is 6 and its nonlinearity is at least 110, demonstrating an improvement in the overall performance of the S-boxes.
-
Key words:
- S-box /
- nonlinearity /
- difference uniformity /
- multi-objective genetic algorithm /
- chaotic map
-
表 1 S盒性能对比
Table 1. Comparison of S-box performances
S 盒 非线性度 DU SAC BIC-SAC BIC-Nonlinearity LAP 透明阶 代数次数/次 最小值 最大值 平均值 本文方案 110 112 111.50 6 0.5000 0.5043 109.71 0.0859 7.840 6 AES 112 112 112.00 4 0.5058 0.5040 112.00 0.0625 7.860 7 文献[9] 96 108 102.50 12 0.5059 0.5050 103.50 0.0625 7.799 6 文献[10] 110 112 110.25 10 0.5000 0.5052 104.00 0.1250 7.824 7 文献[11] 106 108 107.00 10 0.4960 0.4974 104.64 0.0811 7.809 7 文献[12] 110 112 110.25 10 0.4953 0.5021 104.07 0.1250 7.842 6 文献[15] 106 110 107.75 12 0.5034 0.4980 105.29 0.1328 7.833 6 文献[18] 98 106 103.75 8 0.5056 0.5068 103.57 0.1250 7.799 7 -
[1] YONG W, PENG L. An improved method to obtaining S-box based on chaos and genetic algorithm[J]. HKIE Transactions, 2012, 19(4): 53-58. doi: 10.1080/1023697X.2012.10669006 [2] GUESMI R, BEN FARAH M A, KACHOURI A, et al. A novel design of chaos based S-boxes using genetic algorithm techniques[C]//2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA). Doha: IEEE, 2014: 678-684. [3] LIU H J, KADIR A, XU C B. Cryptanalysis and constructing S-box based on chaotic map and backtracking[J]. Applied Mathematics and Computation, 2020, 376: 125153.1-125153.11. [4] 韩妍妍,何彦茹,刘培鹤,等. 一种基于混沌系统的ZUC动态S盒构造及应用方案[J]. 计算机研究与发展,2020,57(10): 2147-2157. doi: 10.7544/issn1000-1239.2020.20200466HAN Yanyan, HE Yanru, LIU Peihe, et al. A dynamic S-box construction and application scheme of ZUC based on chaotic system[J]. Journal of Computer Research and Development, 2020, 57(10): 2147-2157. doi: 10.7544/issn1000-1239.2020.20200466 [5] NASEER Y, SHAH T, SHAH D, et al. A novel algorithm of constructing highly nonlinear S-p-boxes[J]. Cryptography, 2019, 3(1): 6. doi: 10.3390/cryptography3010006 [6] AZAM N A, HAYAT U, ULLAH I. Efficient construction of a substitution box based on a Mordell elliptic curve over a finite field[J]. Frontiers of Information Technology & Electronic Engineering, 2019, 20(10): 1378-1389. [7] MILLAN W, CLARK A, DAWSON E. Smart hill climbing finds better Boolean functions[J] .Workshop on Selected Areas in Cryptology Workshop Record, 1997,9: 50-63. [8] JAKIMOSKI G, KOCAREV L. Chaos and cryptography: block encryption ciphers based on chaotic maps[J]. IEEE Transactions on Circuits and Systems Ⅰ: Fundamental Theory and Applications, 2001, 48(2): 163-169. doi: 10.1109/81.904880 [9] CASSAL-QUIROGA B B, CAMPOS-CANTÓN E. Generation of dynamical S-boxes for block ciphers via extended logistic map[J]. Mathematical Problems in Engineering, 2020, 2020: 2702653.1-2702653.12. [10] ALZAIDI A A, AHMAD M, DOJA M N, et al. A new 1D chaotic map and β-hill climbing for generating substitution-boxes[J]. IEEE Access, 2018, 6: 55405-55418. doi: 10.1109/ACCESS.2018.2871557 [11] ALHADAWI H S, LAMBIĆ D, ZOLKIPLI M F, et al. Globalized firefly algorithm and chaos for designing substitution box[J]. Journal of Information Security and Applications, 2020, 55: 102671.1-102671.13. [12] WANG Y, ZHANG Z Q, ZHANG L Y, et al. A genetic algorithm for constructing bi-jective substitution boxes with high nonlinearity[J]. Information Sciences, 2020, 523: 152-166. doi: 10.1016/j.ins.2020.03.025 [13] SILVA-GARCÍA V M, FLORES-CARAPIA R, RENTERÍA-MÁRQUEZ C, et al. Substitution box generation using Chaos: an image encryption application[J]. Applied Mathematics and Computation, 2018, 332: 123-135. doi: 10.1016/j.amc.2018.03.019 [14] ALHADAWI H S, MAJID M A, LAMBIĆ D, et al. A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm[J]. Multimedia Tools and Applications, 2021, 80(5): 7333-7350. doi: 10.1007/s11042-020-10048-8 [15] ATTAULLA H, JAMAL S S, SHAH T. A novel algebraic technique for the construction of strong substitution box[J]. Wireless Personal Communications, 2018, 99(1): 213-226. doi: 10.1007/s11277-017-5054-x [16] 朱虹宏,佟晓筠,张淼,等. 基于动态复合混沌系统的S盒设计[J]. 南京大学学报(自然科学),2018,54(3): 543-547.ZHU Honghong, TONG Xiaojun, ZHANG Miao, et al. A novel method of designing S-box based on dynamic compound chaotic system[J]. Journal of Nanjing University (Natural Science), 2018, 54(3): 543-547. [17] ULLAH A, JAMAL S S, SHAH T. A novel construction of substitution box using a combination of chaotic maps with improved chaotic range[J]. Nonlinear Dynamics, 2017, 88(4): 2757-2769. doi: 10.1007/s11071-017-3409-1 [18] USAMA M, REHMAN O, MEMON I, et al. An efficient construction of key-dependent substitution box based on chaotic sine map[J]. International Journal of Distributed Sensor Networks, 2019, 15(12): 1-9. [19] ÖZKAYNAK F. Construction of robust substitution boxes based on chaotic systems[J]. Neural Computing and Applications, 2019, 31(8): 3317-3326. doi: 10.1007/s00521-017-3287-y [20] TIAN Y, LU Z M. Chaotic S-box: six-dimensional fractional Lorenz—Duffing chaotic system and O-shaped path scrambling[J]. Nonlinear Dynamics, 2018, 94(3): 2115-2126. doi: 10.1007/s11071-018-4478-5 [21] 陈华,冯登国,吴文玲. 一种改善双射S盒密码特性的有效算法[J]. 计算机研究与发展,2004,41(8): 1410-1414.CHEN Hua, FENG Dengguo, WU Wenling. An effective algorithm for improving cryptographic properties of bijective S-boxes[J]. Journal of Computer Research and Development, 2004, 41(8): 1410-1414. [22] WANG Y, LEI P, WONG K W. A method for constructing bijective S-box with high nonlinearity based on chaos and optimization[J]. International Journal of Bifurcation and Chaos, 2015, 25(10): 1550127.1-1550127.15 [23] PROUFF E. DPA attacks and S-boxes[M]//Fast Software Encryption. Berlin: Springer, 2005: 424-441. [24] ADAMS C, TAVARES S. Good S-boxes are easy to find[J]. Lecture Notes in Computer Science, 1989, 435: 612-615.