• DocumentCode
    1245595
  • Title

    Fast bit-parallel GF(2n) multiplier for all trinomials

  • Author

    Fan, Haining ; Dai, Yiqi

  • Author_Institution
    Dept. of Comput. Sci., Tsinghua Univ., Beijing, China
  • Volume
    54
  • Issue
    4
  • fYear
    2005
  • fDate
    4/1/2005 12:00:00 AM
  • Firstpage
    485
  • Lastpage
    490
  • Abstract
    Based on a new representation of GF(2n), we present two multipliers for all irreducible trinomials. Space complexities of the multipliers match the best results. The time complexity of one multiplier is TA + (1 + [log2 n])TX for all irreducible trinomials, where TA and TX are the delay of one 2-input AND and XOR gates, respectively.
  • Keywords
    computational complexity; digital arithmetic; logic gates; multiplying circuits; polynomials; AND gates; XOR gates; bit-parallel GF(2n) multiplier; irreducible trinomial; space complexity; time complexity; Codes; Cryptography; Delay effects; Galois fields; Polynomials; Index Terms- Finite field; irreducible trinomial.; multiplication; polynomial basis;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

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