The modular exponentiation on large numbers is computationally intensive. An effective way for performing this operation consists in using Montgomery exponentiation in the Residue Number System (RNS). This paper presents an algorithmic and architectural study of such exponentiation approach. From the algorithmic point of view, new and state-of-the-art opportunities that come from the reorganization of operations and precomputations are considered. From the architectural perspective, the design opportunities offered by well-known computer arithmetic techniques are studied, with the aim of developing an efficient arithmetic cell architecture. Furthermore, since the use of efficient RNS bases with a low Hamming weight are being considered with ever more interest, four additional cell architectures specifically tailored to these bases are developed and the tradeoff between benefits and drawbacks is carefully explored. An overall comparison among all the considered algorithmic approaches and cell architectures is presented, with the aim of providing the reader with an extensive overview of the Montgomery exponentiation opportunities in RNS.
An algorithmic and architectural study on Montgomery exponentiation in RNS / Gandino F.; Lamberti F.; Paravati G.; Bajard J.C.; Montuschi P.. - In: IEEE TRANSACTIONS ON COMPUTERS. - ISSN 0018-9340. - STAMPA. - 61:8(2012), pp. 1071-1083.
|Titolo:||An algorithmic and architectural study on Montgomery exponentiation in RNS|
|Data di pubblicazione:||2012|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/TC.2012.84|
|Appare nelle tipologie:||1.1 Articolo in rivista|