A circuit area optimization of MK-3 S-box  

作　　者：Yanjun Li Weiguo Zhang Yiping Lin Jian Zou Jian Liu 

机构地区：[1]Information Industry Information Security Evaluation Center,The 15th Research Institute of China Electronic Technology Group Corporation,Beijing 100083,China [2]Henan Key Laboratory of Network Cryptography Technology,Zhengzhou 450001,China [3]Beijing Electronic Science and Technology Institute,No.7 Fufeng Road,Fengtai Distric,Beijing 100083,China [4]College of Computer and Data Science,Fuzhou University,Fuzhou 350108,China

出　　处：《Cybersecurity》2025年第1期61-71,共11页网络空间安全科学与技术(英文)

基　　金：supported by the Open Project of Henan Key Laboratory of Network Cryptography Technology(NO.LNCT2021-A09);the Advanced Discipline Construction Project of Beijing Universities(20210101Z0401).

摘　　要：In MILCOM 2015,Kelly et al.proposed the authentication encryption algorithm MK-3,which applied the 16-bit S-box.This paper aims to implement the 16-bit S-box with less circuit area.First,we classifed the irreducible polynomials over F_(2n)into three kinds.Then we compared the logic gates required for multiplication over the fnite feld constructed by the three types of irreducible polynomials.According to the comparison result,we constructed the composite felds, F_((2^(4))^(2))and F_((2^(8))^(2)).Based on the isomorphism of fnite felds,the operations over F_(2)^(16)can be conducted over F_((2^(8))^(2)).Similarly,elements over F28 can be mapped to the corresponding elements over F_((2^(4)))^(2).Next,the SAT solver was used to optimize the operations over smaller feld F_(2)^(4).At last,the architecture of the optimized MK-3 S-box was worked out.Compared with the implementation proposed by the original designer,the circuit area of the MK-3 S-box in this paper is reduced by at least 55.9%.

关 键 词：IRREDUCIBLE operations OPTIMIZATION 

分 类 号：TN402[电子电信—微电子学与固体电子学]