A versatile montgomery multiplier architecture with characteristic three support

This is the latest version of this item.

Official URL: http://dx.doi.org/10.1016/j.compeleceng.2008.05.009

We present a novel unified core design which is extended to realize Montgomery multiplication in the fields GF(2(n)), GF(3(m)). and GF(p). Our unified design supports RSA and elliptic Curve schemes, as well as the identity-based encryption which requires a pairing computation on an elliptic Curve. The architecture is pipelined and is highly scalable. The unified core utilizes the redundant signed digit representation to reduce the critical path delay. While the carry-save representation used in classical Unified architectures is only good for addition and Multiplication operations, the redundant signed digit representation also facilitates efficient computation of comparison and subtraction operations besides addition and multiplication. Thus, there is no need for a transformation between the redundant and the non-redundant representations of held elements, which Would be required in the classical unified architectures to realize the subtraction and comparison operations. We also quantify the benefits of the unified architectures in terms of area and critical path delay. We provide detailed implementation results. The metric shows that the new unified architecture provides an improvement over a hypothetical non-unified architecture of at least 24.88%, while the improvement over a classical unified architecture is at least 32.07%. (C) 2008 Elsevier Ltd. All rights reserved.