• DocumentCode
    1421564
  • Title

    Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"

  • Author

    Zhou, Gang ; Michalik, Harald

  • Author_Institution
    Inst. of Comput. & Network Eng., Tech. Univ. of Braunschweig, Braunschweig, Germany
  • Volume
    59
  • Issue
    7
  • fYear
    2010
  • fDate
    7/1/2010 12:00:00 AM
  • Firstpage
    1007
  • Lastpage
    1008
  • Abstract
    In this comment, we show that the gate complexity of Karatsuba polynomial multipliers presented in the above paper can be reduced by exploring the common subexpressions.
  • Keywords
    computational complexity; logic gates; polynomials; Karatsuba polynomial multipliers; composite field; gate complexity; multiplier architecture; parallel finite field multiplier; Complexity theory; Computers; Delay; Gallium nitride; Galois fields; Logic gates; Polynomials; Karatsuba algorithm; finite field.; polynomial multiplication;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2010.46
  • Filename
    5416689
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1421564