Abstract
In this work, we construct a compact composite AES S-Box by deriving a new low multiplicative complexity GF (2 4 ) inversion circuit. A deterministic tree search algorithm is applied to search for constructions that are optimum in terms of multiplicative complexity. From the results, the circuit with the smallest gate count is selected for GF (2 4 ) inversion. To the best of our knowledge, the proposed AES S-Box requires the smallest gate count to date with the size of 112 gates and depth of 25 gates.
Original language | English |
---|---|
Title of host publication | TENCON 2018 - 2018 IEEE Region 10 Conference |
Publisher | IEEE |
Pages | 540-544 |
Number of pages | 5 |
ISBN (Electronic) | 9781538654576 |
DOIs | |
Publication status | Published - 25 Feb 2019 |
Event | IEEE TENCON 2018 - Jeju, Korea, Democratic People's Republic of Duration: 28 Oct 2018 → 31 Oct 2018 http://tencon2018.org/ |
Conference
Conference | IEEE TENCON 2018 |
---|---|
Country/Territory | Korea, Democratic People's Republic of |
City | Jeju |
Period | 28/10/18 → 31/10/18 |
Internet address |
Keywords
- Advanced Encryption Standard (AES)
- S-Box
- composite field arithmetic (CFA)
- low multiplicative complexity
ASJC Scopus subject areas
- Computer Science Applications
- Electrical and Electronic Engineering