Tripartite modular multiplication

Tripartite modular multiplication,10.1016/j.vlsi.2011.03.008,Integration,Kazuo Sakiyama,Miroslav Knežević,Junfeng Fan,Bart Preneel,Ingrid Verbauwhede

Tripartite modular multiplication   (Citations: 1)
BibTex | RIS | RefWorks Download
This paper presents a new modular multiplication algorithm that allows one to implement modular multiplications efficiently. It proposes a systematic approach for maximizing a level of parallelism when performing a modular multiplication. The proposed algorithm effectively integrates three different existing algorithms, a classical modular multiplication based on Barrett reduction, the modular multiplication with Montgomery reduction and the Karatsuba multiplication algorithms in order to reduce the computational complexity and increase the potential of parallel processing. The algorithm is suitable for both hardware implementations and software implementations in a multiprocessor environment. To show the effectiveness of the proposed algorithm, we implement several hardware modular multipliers and compare the area and performance results. We show that a modular multiplier using the proposed algorithm achieves a higher speed comparing to the modular multipliers based on the previously proposed algorithms.
Journal: Integration , vol. 44, no. 4, pp. 259-269, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: