%0 Journal Article
%T A Review of Modular Multiplication Methods ands Respective Hardware Implementation
%A Nadia Nedjah
%A Luiza de Macedo Mourelle
%J Informatica
%D 2006
%I The Slovene Society Informatika, Ljubljana
%X Generally speaking, public-key cryptographic systems consist of raising elements of some group such as GF(2n), Z/NZ or elliptic curves, to large powers and reducing the result modulo some given element. Such operation is often called modular exponentiation and is performed using modular multiplications repeatedly. The practicality of a given cryptographic system depends heavily on how fast modular exponentiations are performed. Consequently, it also depends on how efficiently modular multiplications are done as these are at the base of the computation. This problem has received much attention over the years. Software as well as hardware efficient implementation were proposed. However, the results are scattered through the literature. In this paper we survey most known and recent methods for efficient modular multiplication, investigating and examining their strengths and weaknesses. For each method presented, we provide an adequate hardware implementation.
%K cryptography
%K encryption
%K modular multiplication
%K modular reduction
%U http://www.informatica.si/PDF/30-1/10_Nedjah-A%20Review%20of%20Modular%20Multiplication%20Methods%20and...pdf