DocumentCode :
861399
Title :
Lehmer-based algorithm for computing inverses in Galois fields GF(2m)
Author :
Argüello, F.
Author_Institution :
Dept. of Electron. & Comput. Sci., Univ. of Santiago, Santiago de Compostela, Spain
Volume :
42
Issue :
5
fYear :
2006
fDate :
3/2/2006 12:00:00 AM
Firstpage :
270
Lastpage :
271
Abstract :
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.
Keywords :
Galois fields; digital arithmetic; inverse problems; Galois fields; Lehmer-based algorithm; greatest common divisor; multiplicative inverse computation;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:20063980
Filename :
1604857
Link To Document :
بازگشت