Research and implementation of large-scale S-box for MK-3 algorithm based on polynomial basis: in FPGA

被引:0
|
作者
Hong, Ruipeng [1 ]
Zhang, Lei [2 ]
Pan, Zhankun [3 ]
Xiao, Chaoen [2 ]
Wang, Jianxin [4 ]
机构
[1] Beijing Elect Sci & Technol Inst, Dept Postgrad, 7 Fufeng Rd, Beijing 100070, Peoples R China
[2] Beijing Elect Sci & Technol Inst, Dept Elect & Commun Engn, 7 Fufeng Rd, Beijing 100070, Peoples R China
[3] Beijing Elect Sci & Technol Inst, Dept Cyberspace Secur, 7 Fufeng Rd, Beijing 100070, Peoples R China
[4] Beijing Elect Sci & Technol Inst, Network Informatizat Management Off, 7 Fufeng Rd, Beijing 100070, Peoples R China
基金
中央高校基本科研业务费专项资金资助;
关键词
MK-3; algorithm; Large-scale; S-box; FPGA; Composite field; Polynomial basis; MULTIPLICATION;
D O I
10.1007/s13389-025-00371-x
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The MK-3 algorithm uses a large-scale 16x16 S-box, which is over a Galois Fields GF(2(16))and contains 65536 16-bit elements. In practical Field Programmable Gate Array engineering (FPGA), traditional look-up table method is usually used to implement the S-box in hardware, and this implementation method has problems such as large hardware resources occupancy, poor portability, limited application scenarios, etc. In addition, there are few studies available related to the optimized implementation of large-scale S-box in FPGA. To address the above problems, in this paper a hardware implementation of composite field constructions based on polynomial basis for large-scale S-box is proposed, which completes the linear affine transformation and nonlinear Galois Fields operations in large-scale S-box through logic operations. This paper proposes and implements 3 composite field constructions based on polynomial basis: GF((2(8))(2)), GF((2(4))(2))(2)) and GF((((2(2))(2))(2))(2)). According to the irreducible polynomial sets determined by the 3 construction methods, the corresponding isomorphic functions are calculated, and the corresponding isomorphic matrices and inverse isomorphic matrices are constructed. This simplifies the originally complex 16-bit Galois Fields inversion operations into 8-bit, 4-bit, and 2-bit inversion operations, respectively. Finally, Xilinx's Vivado development tool is used to perform functional simulation verification and comprehensive testing of the 3 constructions in this paper. Experiment results show that the 3 composite field constructions based on polynomial basis proposed in this paper consume 297 LUTs, 223 LUTs, and 236 LUTs respectively, and effectively solve the problem of hardware implementation difficulty of the 16x16 S-box for MK-3 algorithm. Among them, the composite field GF(((2(4))(2))(2)) construction based on polynomial basis proposed in this paper is the optimal solution, reaching the Frequency of 97.09 MHz and Frequency/LUTs of 0.43538, 0.02542 higher than that of the existing optimal scheme of 0.40996. The 3 composite field constructions based on polynomial basis in this paper satisfy the purpose of hardware optimization implementation by increasing the operation Frequency to the utmost while reducing the hardware resources.
引用
收藏
页数:13
相关论文
共 22 条
  • [1] Hardware Optimization of S-box of Camellia Algorithm Based on Polynomial Basis
    Yanjun, Li
    Weiguo, Zhang
    Yaodong, Ge
    Ke, Wang
    JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2023, 45 (03) : 921 - 928
  • [2] FPGA Implementation of Dual Key Based AES Encryption with Key Based S-Box Generation
    Abhiram, L. S.
    Sriroop, B. K.
    Gowrav, L.
    Kumar, Punith H. L.
    Lakkannavar, Manjunath C.
    2015 2ND INTERNATIONAL CONFERENCE ON COMPUTING FOR SUSTAINABLE GLOBAL DEVELOPMENT (INDIACOM), 2015, : 577 - 581
  • [3] Implementation of Low-Area S-Box Based on Normal Basis
    Thomson, Keerthi Elsa
    Mangai, N. M. Siva
    Priya, S. Sridevi Sathiya
    2014 INTERNATIONAL CONFERENCE ON ELECTRONICS AND COMMUNICATION SYSTEMS (ICECS), 2014,
  • [4] Algorithm research of generating S-box based on chaotic system
    Zang, Hongyan
    Min, Lequan
    Wong, Kwok-Wo
    2011 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION AND INDUSTRIAL APPLICATION (ICIA2011), VOL II, 2011, : 319 - 322
  • [5] Algorithm research of generating S-box based on chaotic system
    Zang, Hongyan
    Min, Lequan
    Wong, Kwok-Wo
    2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL VII, 2010, : 320 - 323
  • [6] Resource Efficient Implementation of S-Box Based on Reduced Residue of Prime Numbers using Virtex-5 FPGA
    Rais, Muhammad H.
    Qasim, Syed M.
    WORLD CONGRESS ON ENGINEERING, WCE 2010, VOL II, 2010, : 979 - 983
  • [7] An Area Optimized Implementation of AES S-Box Based on Composite Field and Evolutionary Algorithm
    Liu, Yaoping
    Wu, Ning
    Zhang, Xiaoqiang
    Dong, Liling
    Lan, Lidong
    WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2015, VOL I, 2015, : 33 - 37
  • [8] Quantum Circuit Implementation of S-box for SM4 Cryptographic Algorithm Based on Composite Field Arithmetic
    Luo Q.
    Li X.
    Yang G.
    Niu W.
    Li Q.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2022, 51 (06): : 812 - 818
  • [9] A Box-Covering-Based Routing Algorithm for Large-Scale SDNs
    Zhang, Lianming
    Deng, Qian
    Su, Yiheng
    Hu, Yao
    IEEE ACCESS, 2017, 5 : 4048 - 4056
  • [10] A Novel Secure S-box Design Methodology Based on FPGA and SHA-256 Hash Algorithm for Block Cipher Algorithms
    Aydin, Yilmaz
    Garipcan, Ali Murat
    Ozkaynak, Fatih
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2024, : 1247 - 1260