By Topic

Generalised fast algorithm for computing multiplicative inverses 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
$31 $31
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)
Asano, Y. ; Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan ; Itoh, T. ; Tsujii, S.

The authors have already proposed two types of fast algorithms for computing multiplicative inverses in GF(2m), one is sequential and the other is recursive. In this letter, they present a generalised fast algorithm for multiplicative inverses in GF(2m), which makes use of every subfield of GF(2m).

Published in:

Electronics Letters  (Volume:25 ,  Issue: 10 )