• DocumentCode
    1425610
  • Title

    Double-basis multiplicative inversion over GF(2m)

  • Author

    Hasan, M. Anwarul

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
  • Volume
    47
  • Issue
    9
  • fYear
    1998
  • fDate
    9/1/1998 12:00:00 AM
  • Firstpage
    960
  • Lastpage
    970
  • Abstract
    Inversion over Galois fields is much more difficult than the corresponding multiplication. Efficient computation of inverses in GF(2 m) is considered by solving a set of linear equations over the ground field GF(2). The proposed algorithm uses two separate bases for the representation of its input and output elements and has low computational complexity. The algorithm is also suitable for hardware implementation using VLSI technologies
  • Keywords
    Galois fields; VLSI; computational complexity; digital arithmetic; linear algebra; Galois fields; VLSI technologies; computational complexity; double basis multiplicative inversion; ground field; hardware implementation; linear equations; Arithmetic; Computational complexity; Digital signatures; Elliptic curve cryptography; Equations; Galois fields; Hardware; Polynomials; Protocols; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.713315
  • Filename
    713315
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1425610