2 search results - page 1 / 1 » Faster Double-Size Modular Multiplication from Euclidean Mul... |
CHES
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
TC
2010
12 years 11 months ago
2010
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...