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(2k). 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.
Index Terms— AES cryptosystem, S-Box substitution, multiplicative inverse, pipelined multiplicative inverse.
Mostafa Abd-El-Barr is with the Department of Information Science, CCSE, Kuwait University, Safat 13060, Kuwait (e-mail: mostafa.abdelbarr@gmail.com).
Amro Khattab is with the Computer Science Department, CCSE, Kuwait University, Safat 13060, Kuwait (e-mail: khattab@cs.ku.edu.kw).
[PDF]
Cite: Mostafa Abd-El-Barr and Amro Khattab, " An Efficient Pipelined Multiplicative Inverse Architecture for the AES Cryptosystem," International Journal of Information and Electronics Engineering vol. 4, no. 2, pp. 81-86, 2014.
