You are looking at a specific version 20140227:182904 of this paper. See the latest version.

Paper 2014/142

FPGA-Based High Performance AES-GCM Using Efficient Karatsuba Ofman Algorithm

Karim M. Abdellatif, R. Chotin-Avot, and H. Mehrez

Abstract

AES-GCM has been utilized in various security applications. It consists of two components: an Advanced Encryption Standard (AES) engine and a Galois Hash (GHASH) core. The performance of the system is determined by the GHASH architecture because of the inherent computation feedback. This paper introduces a modification for the pipelined Karatsuba Ofman Algorithm (KOA)-based GHASH. In particular, the computation feedback is removed by analyzing the complexity of the computation process. The proposed GHASH core is evaluated with three different implementations of AES ( BRAMs-based SubBytes, composite field-based SubBytes, and LUT-based SubBytes). The presented AES-GCM architectures are implemented using Xilinx Virtex5 FPGAs. Our comparison to previous work reveals that our architectures are more performance-efficient (Thr. /Slices).

Metadata
Available format(s)
-- withdrawn --
Category
Implementation
Publication info
Published elsewhere. Accepted in International Symposium on Applied Reconfigurable Computing 2014
Keywords
AES-GCMFPGAsGHASHKaratsuba Ofman Algorithm (KOA)
Contact author(s)
karim abdellatif @ lip6 fr
History
2014-02-27: withdrawn
2014-02-27: received
See all versions
Short URL
https://ia.cr/2014/142
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.