• DocumentCode
    3091367
  • Title

    Scalable Montgomery Multiplier for Finite Fields GF(p) and GF(2^m)

  • Author

    Kim, Tae Ho ; Kim, Sang Chul ; Kim, Chang Hoon ; Hong, Chun Pyo

  • Author_Institution
    Korea Adv. Inst. of Sci. & Technol., Daejeon
  • fYear
    2008
  • fDate
    23-25 Jan. 2008
  • Firstpage
    458
  • Lastpage
    461
  • Abstract
    This paper presents a scalable dual-field Montgomery multiplier based on a new multi-precision carry save adder (MP-CSA), which operates in both types of finite fields GF(p) and GF(2m). We also design a word-level adder for cryptographic applications by reusing the proposed multiplier circuit. The proposed Montgomery multiplier has roughly the same timing complexity and the advantage of reduced chip area requirements compared with the previous result.
  • Keywords
    adders; carry logic; cryptography; logic design; multiplying circuits; cryptographic application; finite fields; multiprecision carry save adder; scalable dual-field Montgomery multiplier; timing complexity; word-level adder; Adders; Application software; Circuits; Design engineering; Design methodology; Electronic equipment testing; Galois fields; Mobile communication; Mobile computing; Polynomials; Montgomery Multiplication; Multi-Precision CSA; Scalable Multiplier; VLSI;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electronic Design, Test and Applications, 2008. DELTA 2008. 4th IEEE International Symposium on
  • Conference_Location
    Hong Kong
  • Print_ISBN
    978-0-7695-3110-6
  • Type

    conf

  • DOI
    10.1109/DELTA.2008.102
  • Filename
    4459592
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3091367