By Topic

O(log2 m) iterative algorithm for multiplicative inversion in GF(2m)

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

2 Author(s)
Morioka, S. ; Tokyo Res. Lab., IBM Res., Kanagawa, Japan ; Katayama, Y.

A new algorithm that can calculate the multiplicative inverses in GF(2m) with O(log2 m) iterations is presented. While this algorithm requires in total the same number of multiplications ([log2(m-1)]+Hw(m-1)-1) with the best known algorithm, the latency, if mapped to a hardware, can be reduced significantly ([log2(m-2)]+1), comparable to the best case result, which is implemented using Fermat's little theorem

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference: