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 条
  • [21] Analytical Placement with 3D Poisson's Equation and ADMM Based Optimization for Large-Scale 2.5D Heterogeneous FPGAs
    Chen, Jianli
    Zhu, Wenxing
    Yu, Jun
    He, Lei
    Chang, Yao-Wen
    2019 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2019,
  • [22] Analytical Placement with 3D Poisson's Equation and ADMM-based Optimization for Large-scale 2.5D Heterogeneous FPGAs
    Wei, Min
    Tong, Xingyu
    Wen, Yuan
    Chen, Jianli
    Yu, Jun
    Zhu, Wenxing
    Chang, Yao-Wen
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2023, 28 (05)