DocumentCode :
1466850
Title :
Generalised fast algorithm for computing multiplicative inverses in GF(2m)
Author :
Asano, Y. ; Itoh, T. ; Tsujii, S.
Author_Institution :
Dept. of Electr. & Electron. Eng., Tokyo Inst. of Technol., Japan
Volume :
25
Issue :
10
fYear :
1989
fDate :
5/11/1989 12:00:00 AM
Firstpage :
664
Lastpage :
665
Abstract :
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).
Keywords :
Boolean algebra; signal processing; Boolean algebra; GF(2 m); circuit complexity; generalised fast algorithm; multiplicative inverses; signal processing;
fLanguage :
English
Journal_Title :
Electronics Letters
Publisher :
iet
ISSN :
0013-5194
Type :
jour
DOI :
10.1049/el:19890449
Filename :
91753
Link To Document :
بازگشت