| Autor: |
LI Yan-Jun, ZHANG Wei-Guo, GE Yao-Dong, HUANG Ya-Ting, HUO Shan-Shan |
| Předmět: |
|
| Zdroj: |
Journal of Cryptologic Research (2095-7025); 2023, Vol. 10 Issue 3, p531-538, 8p |
| Abstrakt: |
Based on a polynomial basis, this paper constructs a finite field operation to optimize the S-box of the AES algorithm. By searching for the isomorphic mapping matrix between the fields, the inverse operation over finite field GF(28) is converted to the composite field GF((24)²). By using the SAT solver to search for the multiplication inverse operation over the finite field GF(24), two different polynomial basis optimization schemes are proposed. Scheme 1 uses the classic Class 3 gate circuit to construct the composite field. Based on Scheme 1, Scheme 2 uses a bit-level optimization method that introduces a MUX gate, and has less circuit area and smaller number of gates than those in Scheme 1. This paper uses the SMIC130 nm and SMIC65 nm processors to evaluate the circuit area. The evaluation shows that the results of this paper are better than the existing schemes using the same kind of gate circuits. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
