Performance evaluation of scalar multiplication in elliptic curve cryptography implementation using different multipliers over binary field GF (2233)‎

Abstract EN

This paper presents a point multiplication processor over the binary field GF (2233) with internal registers integrated within the point-addition architecture to enhance the Performance Index (PI) of scalar multiplication.

The proposed design uses one of two types of finite field multipliers, either the Montgomery multiplier or the interleaved multiplier supported by the additional layer of internal registers.

Lopez Dahab coordinates are used for the computation of point multiplication on Koblitz Curve (K-233bit).

In contrast, the metric used for comparison of the implementations of the design on different types of FPGA platforms is the Performance Index.

The first approach attains a performance index of approximately 0.

217610202 when its realization is over Virtex-6 (6vlx130tff1156-3).

It uses an interleaved multiplier with 3077 register slices, 4064 lookup tables (LUTs), 2837 flip-flops (FFs) at a maximum frequency of 221.

6Mhz.

This makes it more suitable for high-frequency applications.

The second approach, which uses the Montgomery multiplier, produces a PI of approximately 0.

2228157 when its implementation is on Virtex-4 (6vlx130tff1156-3).

This approach utilizes 3543 slices, 2985 LUTs, 3691 FFs at a maximum frequency of 190.

47MHz.

Thus, it is found that the implementation of the second approach on Virtex-4 is more suitable for applications with a low frequency of about 86.

4Mhz and a total number of slices of about 12305.