• DocumentCode
    1438259
  • Title

    An efficient optimal normal basis type II multiplier

  • Author

    Sunar, B. ; Koç, ç K.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Worcester Polytech. Inst., MA, USA
  • Volume
    50
  • Issue
    1
  • fYear
    2001
  • fDate
    1/1/2001 12:00:00 AM
  • Firstpage
    83
  • Lastpage
    87
  • Abstract
    This paper presents a new parallel multiplier for the Galois field GF(2m) whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1.5(m2 -m) XOR gates, as compared to 2(m2-m) XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar
  • Keywords
    Galois fields; computational complexity; digital arithmetic; Galois field; Massey-Omura multiplier; efficient optimal normal basis type II multiplier; parallel multiplier; time complexity; Algebra; Algorithm design and analysis; Application software; Codes; Cryptography; Digital arithmetic; Galois fields; Hardware; Polynomials;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.902754
  • Filename
    902754
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1438259