• DocumentCode
    2329299
  • Title

    GF(2m) multiplier using Polynomial Residue Number System

  • Author

    Chu, Junfeng ; Benaissa, Mohammed

  • Author_Institution
    Dept. of Electron. & Electr. Eng., Univ. of Sheffield, Sheffield
  • fYear
    2008
  • fDate
    Nov. 30 2008-Dec. 3 2008
  • Firstpage
    1514
  • Lastpage
    1517
  • Abstract
    This paper studies the polynomial residue representation of Galois field (2m) elements and polynomial residue arithmetic (PRA), according to which a novel approach of performing GF(2m) multiplication using polynomial residue number system (PRNS) is introduced. A channel-serial and a channel-parallel architecture of the PRNS multiplier over GF(2m) are presented. Conclusion is drawn by comparing the synthesis results of these two architectures.
  • Keywords
    Galois fields; polynomials; residue number systems; GF multiplier; Galois field; channel-parallel architecture; polynomial residue number system; Arithmetic; Cathode ray tubes; Circuits; Dynamic range; Elliptic curve cryptography; Field programmable gate arrays; Galois fields; Hardware; Polynomials; Signal processing algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on
  • Conference_Location
    Macao
  • Print_ISBN
    978-1-4244-2341-5
  • Electronic_ISBN
    978-1-4244-2342-2
  • Type

    conf

  • DOI
    10.1109/APCCAS.2008.4746320
  • Filename
    4746320
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2329299