By Topic

Lehmer-based algorithm for computing inverses in Galois fields 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

1 Author(s)
Arguello, F. ; Dept. of Electron. & Comput. Sci., Univ. of Santiago, Santiago de Compostela, Spain

An algorithm for computing multiplicative inverses in Galois fields GF(2m) is presented. It is based on Lehmer's algorithm for computing the greatest common divisor of two integers. The algorithm is designed to be advantageous for Galois fields of large size.

Published in:

Electronics Letters  (Volume:42 ,  Issue: 5 )