Sign in
Back
A fast parallel implementation of elliptic curve point multiplication over GF(2 m)
Journal article   Peer reviewed

A fast parallel implementation of elliptic curve point multiplication over GF(2 m)

F. Rodrı́guez-Henrı́quez, N.A. Saqib and A. Dı́az-Pérez
Microprocessors and microsystems, Vol.28(5), pp.329-339
02/08/2004
DOI: https://doi.org/10.1016/j.micpro.2004.03.003

Abstract

Elliptic curve cryptography Finite field arithmetic Karatsuba–Ofman multipliers
A fast parallel architecture for the implementation of elliptic curve scalar multiplication over binary fields is presented. The proposed architecture is implemented on a single-chip FPGA device using parallel strategies that trades area requirements for timing performance. The results achieved show that our proposed design is able to compute GF(2191) elliptic curve scalar multiplication operations in 63 μs.

Metrics

1 Record Views

Details