Construction of a Low Multiplicative Complexity GF (24) Inversion Circuit for Compact AES S-Box

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 wit...

Full description

Saved in:
Bibliographic Details
Main Authors: Tay, Jia Jun, Wong, M. L. Dennis, Wong, Ming Ming, Zhang, Cishen, Hijazin, Ismat
Format: Conference Proceeding
Language:English
Subjects:
Advanced Encryption Standard (AES)
Complexity theory
composite field arithmetic (CFA)
Conferences
Encryption
IEEE Regions
Logic gates
low multiplicative complexity
Optimization
Poles and towers
S-Box
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2159-3450
DOI:10.1109/TENCON.2018.8650149