A carry-free architecture for Montgomery inversion
Savaş, Erkay (2005) A carry-free architecture for Montgomery inversion. IEEE Transactions on Computers, 54 (12). pp. 1508-1519. ISSN 0018-9340
This is the latest version of this item.
Official URL: http://dx.doi.org/10.1109/TC.2005.188
A new carry-free Montgomery inversion algorithm which is suitable for hardware implementation is presented. The algorithm utilizes a new redundant sign digit (RSD) representation and arithmetic to avoid carry propagation in addition and subtraction, which are the atomic operations in the Montgomery inversion algorithm. The proposed algorithm is described in such a way that its hardware realization is straightforward. The algorithm enables very fast computation of multiplicative inversion in GF(p), which is the most time-consuming operation in elliptic and hyperelliptic curve cryptography. Complexity analysis and a gate level implementation of the algorithm reveal that the proposed algorithm provides a speedup of at least 1.95 over the original Montgomery inversion algorithm.
Available Versions of this Item
Repository Staff Only: item control page