DocumentCode
2645980
Title
An efficient 21.56 Gbps AES implementation on FPGA
Author
Zhang, Xinmiao ; Parhi, Keshab K.
Author_Institution
Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN, USA
Volume
1
fYear
2004
fDate
7-10 Nov. 2004
Firstpage
465
Abstract
This paper presents novel high-speed architectures for the hardware implementation of the advanced encryption standard (AES) algorithm. Unlike previous works, which rely on look-up tables to implement the subbytes and invsubbytes transformations of the AES algorithm, the proposed design employs combinational logic only. As a direct consequence, the unbreakable delay incurred by look-up tables in the conventional approaches is eliminated and the advantage of subpipelining can be further explored. Furthermore, composite field arithmetic is employed to reduce the area requirements and different implementations for the inversion in subfield GF(24) are compared. In addition, efficient key expansion architecture suitable for the subpipelined round units is also presented. Using the proposed architecture, a fully subpipelined encryptor with 7 substages in each round unit can achieve a throughput of 21.56 Gbps on a Xilinx XCV 1000e-8bg560 device in nonfeedback modes, which is faster and is 79% more efficient than the fastest previous FPGA implementation known to date.
Keywords
Galois fields; cryptography; pipeline arithmetic; table lookup; 21.56 Byte/s; AES; GF; Galois fields; Xilinx XCV; advanced encryption standard algorithm; combinational logic; composite field arithmetic; high-speed architecture; look-up table; subpipelined encryptor; Arithmetic; Computer architecture; Cryptography; Delay; Electronic mail; Field programmable gate arrays; Hardware; NIST; Table lookup; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference on
Print_ISBN
0-7803-8622-1
Type
conf
DOI
10.1109/ACSSC.2004.1399176
Filename
1399176
Link To Document