• DocumentCode
    777956
  • Title

    Low complexity parallel multiplier in F(qn) over Fq

  • Author

    Huapeng Wu ; Anwar Hasan, M. ; Blake, Ian F.

  • Author_Institution
    Centre for Appl. Cryptographic Res., Waterloo Univ., Ont.
  • Volume
    49
  • Issue
    7
  • fYear
    2002
  • fDate
    7/1/2002 12:00:00 AM
  • Firstpage
    1009
  • Lastpage
    1013
  • Abstract
    In this brief, parallel multiplication in F(qn) over Fq, where q can be a prime power, is considered. A closed form proof has been given for the size complexity bound of the parallel multiplier. Implementation with reduced propagation delay has been shown with an example. Basis conversion between the weakly dual basis and the polynomial basis has also been discussed
  • Keywords
    Galois fields; computational complexity; cryptography; digital arithmetic; matrix multiplication; multivalued logic; parallel algorithms; polynomial matrices; basis conversion; binary tree of adders; closed form proof; cryptosystems; finite field multiplications; linear feedforward register; low complexity parallel multiplier; monic irreducible polynomial; multivalued logic; polynomial basis; prime power; reduced propagation delay; reduction matrix; size complexity bound; weakly dual basis; Application software; Circuits; Cryptography; Polynomials; Propagation delay;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1057-7122
  • Type

    jour

  • DOI
    10.1109/TCSI.2002.800836
  • Filename
    1016834
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=777956