• DocumentCode
    1700982
  • Title

    Novel Mastrovito Multiplier over GF(2m) Using Trinomial

  • Author

    Chiou, Che Wun ; Lin, Jim-Min ; Lee, Chiou-Yng ; Chi-Ting Ma

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Ching Yun Univ., Chungli, Taiwan
  • fYear
    2011
  • Firstpage
    237
  • Lastpage
    242
  • Abstract
    In recent years, mobile communication becomes more and more popular. Thus, information security on electronic commerce is an important issue for mobile communication. The finite field arithmetic operations are applied in modern public-key cryptosystems such as elliptic curve cryptosystem (ECC). In this article, a novel systolic polynomial basis multiplier based on Mastrovito multiplier is presented. The proposed systolic Mastrovito multiplier has low hardware cost by employing reused components. As m=81, the proposed systolic Mastrovito multiplier saves about 50% space complexity as comparing with other similar multipliers.
  • Keywords
    electronic commerce; mobile communication; parallel algorithms; polynomials; public key cryptography; electronic commerce; elliptic curve cryptosystem; finite field arithmetic operations; hardware cost; information security; mobile communication; public key cryptosystem; systolic Mastrovito multiplier; systolic polynomial basis multiplier; trinomial; Computer architecture; Educational institutions; Elliptic curve cryptography; Galois fields; Hardware; Microprocessors; Polynomials; Mastrovito multiplier; cryptography; elliptic curve cryptosystem; finite field multiplier; public-key cryptosystems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Genetic and Evolutionary Computing (ICGEC), 2011 Fifth International Conference on
  • Conference_Location
    Xiamen
  • Print_ISBN
    978-1-4577-0817-6
  • Electronic_ISBN
    978-0-7695-4449-6
  • Type

    conf

  • DOI
    10.1109/ICGEC.2011.63
  • Filename
    6042772