By Topic

The FPGA implementation of multiplicative inverse value of GF(28) generator using Extended Euclid Algorithm (EEA) method for Advanced Encryption Standard (AES) algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yeong Chee Mei ; Sch. of Microelectron. Eng., Univ. Malaysia Perlis, Arau, Malaysia ; Naziri, S.

Extended Euclid Algorithm (EEA) is one of the alternatives in gaining the multiplicative inverse value in finite field GF(28). Previously, the look-up table (LUT) approach is widely used for this purpose, especially in hardware cryptographic implementations. In this paper, the EEA method is used to build the multiplicative inverse value generator as an alternative of the commonly used LUT method. The generator is implemented in hardware environment using Verilog HDL. By the aid of Altera QuartusII, the generator design is synthesized with the total of 9,940 logic gates and 5,957 instances, with the propagation delay of 7.63 ns. As a proof of hardware implementation, the design is downloaded into an Altera EPF10K70RC240-4 FPGA. This EEA-based inverse generator is proposed to create an alternative approach in generating the inverse value in Advanced Encryption Standard (AES) for hardware-based implementation.

Published in:

Computer Applications and Industrial Electronics (ICCAIE), 2011 IEEE International Conference on

Date of Conference:

4-7 Dec. 2011