Scalable Dual-Field Montgomery Multiplier Using Multi-Precision Carry Save Adder 


Vol. 33,  No. 1, pp. 131-139, Jan.  2008


PDF
  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). The new MP-CSA consists of two carry save adders (CSA). Each CSA is composed of n=[w/b] carry propagation adders (CPA) for a modular multiplication with w-bit words, where b is the number of dual field adders (DFA) in a CPA. The proposed Montgomery multiplier has roughly the same timing complexity compared with the previous result, however, it has the advantage of reduced chip area requirements. In addition, the proposed circuit produces the exact modular multiplication result at the end of operation unlike the previous architecture. Furthermore, the proposed Montgomery multiplier has a high scalability in terms of w and m. Therefore, it can be used to multiplier over GF(p) and GF(2m) for cryptographic applications.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. H. Kim, C. H. Kim, C. P. Hong, "Scalable Dual-Field Montgomery Multiplier Using Multi-Precision Carry Save Adder," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 131-139, 2008. DOI: .

[ACM Style]

Tae Ho Kim, Chang Hoon Kim, and Chun Pyo Hong. 2008. Scalable Dual-Field Montgomery Multiplier Using Multi-Precision Carry Save Adder. The Journal of Korean Institute of Communications and Information Sciences, 33, 1, (2008), 131-139. DOI: .

[KICS Style]

Tae Ho Kim, Chang Hoon Kim, Chun Pyo Hong, "Scalable Dual-Field Montgomery Multiplier Using Multi-Precision Carry Save Adder," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 1, pp. 131-139, 1. 2008.