• DocumentCode
    1332531
  • Title

    Efficient Polynomial Basis Multipliers for Type-II Irreducible Pentanomials

  • Author

    Imana, J.L.

  • Author_Institution
    Dept. of Comput. Archit. & Syst. Eng., Complutense Univ. of Madrid, Madrid, Spain
  • Volume
    59
  • Issue
    11
  • fYear
    2012
  • Firstpage
    795
  • Lastpage
    799
  • Abstract
    Bit-parallel polynomial basis multipliers over the finite field GF(2m) generated using type-II irreducible pentanomials are considered in this brief. The bit-parallel multipliers presented here have the lowest delay known to date for similar multipliers based on this type of irreducible pentanomials, with a very small increase of XOR gates.
  • Keywords
    Galois fields; logic gates; multiplying circuits; polynomials; GF(2m) finite field; XOR gates; bit-parallel polynomial basis multipliers; polynomial basis multipliers; type-II irreducible pentanomials; Complexity theory; Delay; Logic gates; Matrix decomposition; Polynomials; Silicon; Vectors; $GF(2^{m})$; Bit-parallel multipliers; finite field; irreducible pentanomials; polynomial basis (PB);
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Express Briefs, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1549-7747
  • Type

    jour

  • DOI
    10.1109/TCSII.2012.2222836
  • Filename
    6352866
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1332531