• ISSN 0258-2724
  • CN 51-1277/U
  • EI Compendex
  • Scopus 收录
  • 全国中文核心期刊
  • 中国科技论文统计源期刊
  • 中国科学引文数据库来源期刊

基于多目标遗传算法的8 × 8 S盒的优化设计方法

王永 王明月 龚建

王永, 王明月, 龚建. 基于多目标遗传算法的8 × 8 S盒的优化设计方法[J]. 西南交通大学学报. doi: 10.3969/j.issn.0258-2724.20210377
引用本文: 王永, 王明月, 龚建. 基于多目标遗传算法的8 × 8 S盒的优化设计方法[J]. 西南交通大学学报. doi: 10.3969/j.issn.0258-2724.20210377
WANG Yong, WANG Mingyue, GONG Jian. Optimal Design Method of 8 × 8 S-box Based on Multi-objective Genetic Algorithm[J]. Journal of Southwest Jiaotong University. doi: 10.3969/j.issn.0258-2724.20210377
Citation: WANG Yong, WANG Mingyue, GONG Jian. Optimal Design Method of 8 × 8 S-box Based on Multi-objective Genetic Algorithm[J]. Journal of Southwest Jiaotong University. doi: 10.3969/j.issn.0258-2724.20210377

基于多目标遗传算法的8 × 8 S盒的优化设计方法

doi: 10.3969/j.issn.0258-2724.20210377
基金项目: 国家自然科学基金(61472464);重庆市自然科学基金(cstc2021jcyj-msxmX0557)
详细信息
    作者简介:

    王永(1977—),男,教授,研究方向为信息安全、混沌密码、隐私保护,E-mail:wangyong1@cqupt.edu.cn

  • 中图分类号: TP18;TN918.1

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盒的综合性能.

     

  • 图 1  算法流程

    Figure 1.  Algorithm flowchart

    图 2  数组A

    Figure 2.  Array A

    图 3  每代中最佳10%S盒的非线性分布

    Figure 3.  Nonlinearity distributions of best 10% S-boxes in each generation

    图 4  每代中最佳10%S盒的差分均匀度分布

    Figure 4.  Difference uniformity distributions of best 10% S-boxes in each generation

    图 5  S盒种群的性能分布情况

    Figure 5.  Performance distribution of S-box populations

    图 6  S盒示例

    Figure 6.  Example of S-box

    图 7  示例S盒的差分分布矩阵

    Figure 7.  Difference distribution matrix of exemplified S-box

    图 8  示例S盒BIC-Nonlinearity

    Figure 8.  BIC-Nonlinearity of exemplified S-box

    图 9  示例S盒的BIC-SAC

    Figure 9.  BIC-SAC of exemplified S-box

    图 10  示例S盒的依赖矩阵

    Figure 10.  Dependency matrix of exemplified S-box

    表  1  S盒性能对比

    Table  1.   Comparison of S-box performances

    S盒非线性度DUSACBIC-SACBIC-NonlinearityLAP透明阶代数次数/次
    最小值最大值平均值
    本文方案110112111.5060.50000.5043109.710.08597.8406
    AES112112112.0040.50580.5040112.000.06257.8607
    文献[9]96108102.50120.50590.5050103.500.06257.7996
    文献[10]110112110.25100.50000.5052104.000.12507.8247
    文献[11]106108107.00100.49600.4974104.640.08117.8097
    文献[12]110112110.25100.49530.5021104.070.12507.8426
    文献[15]106110107.75120.50340.4980105.290.13287.8336
    文献[18]98106103.7580.50560.5068103.570.12507.7997
    下载: 导出CSV
  • [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.20200466

    HAN 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 I: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 bijective 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] Attaullah, 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, Heidelberg: 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.
  • 加载中
图(10) / 表(1)
计量
  • 文章访问数:  27
  • HTML全文浏览量:  11
  • PDF下载量:  7
  • 被引次数: 0
出版历程
  • 收稿日期:  2021-05-10
  • 修回日期:  2022-03-03
  • 网络出版日期:  2024-04-19

目录

    /

    返回文章
    返回