• DocumentCode
    1497433
  • Title

    A fast algorithm for multiplicative inversion in GF(2m) using normal basis

  • Author

    Takagi, Naofumi ; Yoshiki, Jun-ichi ; Takagi, Kazuyoshi

  • Author_Institution
    Dept. of Inf. Eng., Nagoya Univ., Japan
  • Volume
    50
  • Issue
    5
  • fYear
    2001
  • fDate
    5/1/2001 12:00:00 AM
  • Firstpage
    394
  • Lastpage
    398
  • Abstract
    A fast algorithm for multiplicative inversion in GF(2m) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat´s theorem and require O(logm) multiplications. The number of multiplications is reduced by decomposing m-1 into several factors and a small remainder
  • Keywords
    Galois fields; cryptography; error correction codes; Fermat´s theorem; O(logm) multiplications; multiplicative inversion; normal basis; Computer Society; Cryptography; Error correction codes; Galois fields; Iterative algorithms;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.926155
  • Filename
    926155
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1497433