Construction of Optimum Composite Field Architecture for Compact High-Throughput AES S-Boxes
Authors:
- 10 May 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 20 (6) , 1151-1155
Abstract
In this work, we derive three novel composite field arithmetic (CFA) Advanced Encryption Standard (AES) S-boxes of the field GF(((22)2)2). The best construction is selected after a sequence of algorithmic and architectural optimization processes. Furthermore, for each composite field constructions, there exists eight possible isomorphic mappings. Therefore, after the exploitation of a new common subexpression elimination algorithm, the isomorphic mapping that results in the minimal implementation area cost is chosen. High throughput hardware implementations of our proposed CFA AES S-boxes are reported towards the end of this paper. Through the exploitation of both algebraic normal form and seven stages fine-grained pipelining, our best case achieves a throughput 3.49 Gbps on a Cyclone II EP2C5T144C6 field-programmable gate array.Keywords
This publication has 8 references indexed in Scilit:
- A new common subexpression elimination algorithm with application in composite field AES S-box2010
- Approximation Algorithms for Bounded Degree Phylogenetic RootsAlgorithmica, 2007
- On the Optimum Constructions of Composite Field for the AES AlgorithmIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2006
- A Very Compact Rijndael S-box2005
- AES implementation on a grain of sandIEE Proceedings - Information Security, 2005
- High-speed VLSI architectures for the AES algorithmIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2004
- On efficient inversion in tower fields of characteristic two1997
- Some remarks on efficient inversion in finite fields1995