• DocumentCode
    765224
  • Title

    Division and bit-serial multiplication over GF(qm)

  • Author

    Hasan, M.A. ; Bhargava, V.K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Victoria Univ., BC, Canada
  • Volume
    139
  • Issue
    3
  • fYear
    1992
  • fDate
    5/1/1992 12:00:00 AM
  • Firstpage
    230
  • Lastpage
    236
  • Abstract
    Division and bit-serial multiplication in finite fields are considered. Using co-ordinates of the supporting elements it is shown that, when field elements are represented by polynomials, division over GF(qm) can be performed by solving a system of m linear equations over GF(q). For a canonical basis representation, a relationship between the division and the discrete-time Wiener-Hopf equation of degree m over GF(q) is derived. This relationship leads to a bit-serial multiplication scheme that can be easily realised for all irreducible polynomials.
  • Keywords
    digital arithmetic; polynomials; bit-serial multiplication; canonical basis representation; finite fields; irreducible polynomials; linear equations; polynomials;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    141540
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=765224