loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008)
Scalable Montgomery Multiplier for Finite Fields GF(p) and GF(2^m)
January 23-January 25
ISBN: 978-0-7695-3110-6
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(2^m). 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.
Index Terms:
Montgomery Multiplication, Multi-Precision CSA, Scalable Multiplier, VLSI
Citation:
Tae Ho Kim, Sang Chul Kim, Chang Hoon Kim, Chun Pyo Hong, "Scalable Montgomery Multiplier for Finite Fields GF(p) and GF(2^m)," delta, pp.458-461, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.