A parallel architecture for fast computation of elliptic curve scalar multiplication over GF(2/sup m/)
Nazar Abbas Saqib, Francisco Rodríguez‐Henríquez, Arturo Díaz-Pérez · 2004
Summary form only given. We present a generic parallel architecture for fast elliptic curve scalar multiplication over binary extension fields. We show how the parallel strategy followed in this work leads to high performance designs. We also implemented the proposed architecture on reconfigurable hardware devices where the predicted expeditious performance figures were actually obtained. The results achieved show that our proposed design is able to compute GF(2/sup 191/) elliptic curve scalar multiplication operations in 56.44 /spl mu/Secs.