Indexed by:
Abstract:
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 classified the irreducible polynomials over (Formula presented.) into three kinds. Then we compared the logic gates required for multiplication over the finite field constructed by the three types of irreducible polynomials. According to the comparison result, we constructed the composite fields, (Formula presented.) and (Formula presented.). Based on the isomorphism of finite fields, the operations over (Formula presented.) can be conducted over (Formula presented.). Similarly, elements over (Formula presented.) can be mapped to the corresponding elements over (Formula presented.). Next, the SAT solver was used to optimize the operations over smaller field (Formula presented.). 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%. © The Author(s) 2024.
Keyword:
Reprint 's Address:
Email:
Source :
Cybersecurity
ISSN: 2096-4862
Year: 2024
Issue: 1
Volume: 7
4 . 0 0 0
JCR@2023
Cited Count:
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: