Cryptology ePrint Archive: Report 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).

Category / Keywords: implementation / AES-GCM, FPGAs, GHASH, Karatsuba Ofman Algorithm (KOA)

Original Publication (in the same form): Accepted in International Symposium on Applied Reconfigurable Computing 2014

Date: received 25 Feb 2014, withdrawn 27 Feb 2014

Contact author: karim abdellatif at lip6 fr

Available format(s): (-- withdrawn --)

Version: 20140227:182904 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]