• DocumentCode
    1414009
  • Title

    Efficient normal basis multipliers in composite fields

  • Author

    Sangho Oh ; Kim, Chang Han ; Lim, Jongin ; Cheon, Dong Hyeon

  • Author_Institution
    Centre for Inf. Securities Technol., Korea Univ., Seoul, South Korea
  • Volume
    49
  • Issue
    10
  • fYear
    2000
  • fDate
    10/1/2000 12:00:00 AM
  • Firstpage
    1133
  • Lastpage
    1138
  • Abstract
    It is well-known that a class of finite fields GF(2n) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier
  • Keywords
    digital arithmetic; multiplying circuits; bit-parallel multiplier; composite fields; finite fields; hardware architecture; normal basis multipliers; Arithmetic; Elliptic curve cryptography; Elliptic curves; Galois fields; Hardware; Polynomials; Public key cryptography;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.888054
  • Filename
    888054
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1414009