• DocumentCode
    1394508
  • Title

    Low-complexity Gaussian normal basis multiplier over GF(2m)

  • Author

    Chiou, Che Wun ; Chang, H.W. ; Liang, W.-Y. ; Lee, Chen-Yi ; Lin, Jim-Min ; Yeh, Y.-C.

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Chien Hsin Univ. of Sci. & Technol., Chungli, Taiwan
  • Volume
    6
  • Issue
    4
  • fYear
    2012
  • Firstpage
    310
  • Lastpage
    317
  • Abstract
    The elliptic curve cryptosystem (ECC) is very attractive for the use in portable devices because of the small key size. The finite field multiplication over GF(2m) is the most important arithmetic for performing the ECC. Portable devices usually have restricted computation power and memory resources. This work will present a simple method for designing a Gaussian normal basis (GNB) multiplier over GF(2m) needing only fewer computation power whereas keeping lower cost. The proposed Gaussian NB multiplier saves ~57~ space complexity as compared with existing GNB multiplier.
  • Keywords
    cryptography; logic design; multiplying circuits; ECC; GNB multiplier; elliptic curve cryptosystem; finite field multiplication; low-complexity Gaussian normal basis multiplier; memory resources; portable devices;
  • fLanguage
    English
  • Journal_Title
    Information Security, IET
  • Publisher
    iet
  • ISSN
    1751-8709
  • Type

    jour

  • DOI
    10.1049/iet-ifs.2012.0110
  • Filename
    6404339
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1394508