• DocumentCode
    1337569
  • Title

    Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

  • Author

    KoÇ, Ç K. ; Sunar, B.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
  • Volume
    47
  • Issue
    3
  • fYear
    1998
  • fDate
    3/1/1998 12:00:00 AM
  • Firstpage
    353
  • Lastpage
    356
  • Abstract
    We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m2-1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier
  • Keywords
    computational complexity; digital arithmetic; logic design; multiplying circuits; all-one-polynomial; bit-parallel; canonical basis; finite fields; low-complexity; multiplication; multiplier; normal basis; Algebra; Application software; Codes; Cryptography; Digital arithmetic; Galois fields; Hardware; Polynomials; Process design;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.660172
  • Filename
    660172
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1337569