An Efficient Pipelined Multiplicative Inverse Architecture for the AES Cryptosystem

Abstract

In this paper, we introduce an architecture for performing a recursive pipeline algorithm for use in optimizing the performance of the multiplicative inverse operations in Galois Field GF(2 k). The latter is extensively used in performing the S-Box byte-Substitution in the AES cryptosystem. Using composite fields the operations are recursively decomposed into lower level ones which are mapped into pipelines. Thus, several gate reductions will be obtained and gate sharing. Eventually, this enhances the performance of computing the multiplicative inverse.