مرکز منطقه ای اطلاع رساني علوم و فناوري - Effective recursive algorithm for computing multiplicative inverses in <e1>GF</e1>(2<sup>m</sup>)

DocumentCode :

1295949

Title :

Effective recursive algorithm for computing multiplicative inverses in GF(2^m)

Author :

Itoh, Takayuki ; Tsujii, S.

Author_Institution :

Dept. of Electr. & Electron Eng., Tokyo Inst. of Technol.

Volume :

Issue :

fYear :

1988

fDate :

3/17/1988 12:00:00 AM

Firstpage :

334

Lastpage :

335

Abstract :

Presents an effective recursive algorithm for computing multiplicative inverses in GF(2^m), where m=2^k, employing normal bases. The proposed algorithm requires m-1 cyclic shifts and two multiplications in GF (2^m) and in each subfield of GF(2^m): GF(2^m/2), GF(2^m/4),. . ., GF (2⁸) and GF(2⁴)

Keywords :

codes; polynomials; GF(2^m); codes; multiplicative inverses; polynomial field; recursive algorithm;

fLanguage :

English

Journal_Title :

Electronics Letters

Publisher :

iet

ISSN :

0013-5194

Type :

jour

Filename :

8200

Link To Document :

https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=1295949