• DocumentCode
    958530
  • Title

    On computing multiplicative inverses in GF(2m)

  • Author

    Brunner, Hannes ; Curiger, Andreas ; Hofstetter, Max

  • Author_Institution
    Integrated Syst. Lab., ETH, Zurich, Switzerland
  • Volume
    42
  • Issue
    8
  • fYear
    1993
  • fDate
    8/1/1993 12:00:00 AM
  • Firstpage
    1010
  • Lastpage
    1015
  • Abstract
    The design of a modular standard basis inversion for Galois fields GF(2m) based on Euclid´s algorithm for computing the greatest common divisor of two polynomials is presented. The asymptotic complexity is linear with m both in computation time and area requirement, thus resulting in an AT-complexity of O( m2). This is a significant improvement over the best previous proposal which achieves AT-complexity of only O (m3)
  • Keywords
    digital arithmetic; AT-complexity; Euclid´s algorithm; Galois fields; area requirement; asymptotic complexity; computation time; computing multiplicative inverses; greatest common divisor; modular standard basis inversion; polynomials; Art; Digital arithmetic; Elliptic curves; Galois fields; Notice of Violation; Polynomials; Programming; Proposals; Table lookup; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.238496
  • Filename
    238496
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=958530