By Topic

Efficient method to find the multiplicative inverse in GF (2m) using FPGA by exponentiation to (2k)

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
$33 $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

3 Author(s)

Multiplicative inverse in GF (2m) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2m). In this paper, a fast method is suggested to find inversion in GF (2m) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2k). In the proposed algorithm, the multiplicative inverse in GF(2m) is achieved by number of multiplications depending on log2(m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two exponentiation. The number of multiplications is in range between (log2(m) and 2log2(m)-2). If m equals 163 then the number of multiplication operations is 9 and number of exponentiation operation each one with one clock cycle equals 10.

Published in:

Future Communication Networks (ICFCN), 2012 International Conference on

Date of Conference:

2-5 April 2012