• DocumentCode
    1295949
  • Title

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

  • Author

    Itoh, Takayuki ; Tsujii, S.

  • Author_Institution
    Dept. of Electr. & Electron Eng., Tokyo Inst. of Technol.
  • Volume
    24
  • Issue
    6
  • 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(2m), where m=2k, employing normal bases. The proposed algorithm requires m-1 cyclic shifts and two multiplications in GF (2m) and in each subfield of GF(2m): GF(2m/2), GF(2m/4),. . ., GF (28) and GF(24)
  • Keywords
    codes; polynomials; GF(2m); 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.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1295949