A parallel architecture for computing scalar multiplication on Hessian elliptic curves
Nazar Abbas Saqib, Francisco Rodríguez‐Henríquez, Arturo Díaz-Pérez · 2004
A parallel architecture for the computation of Hessian elliptic curve scalar multiplication over binary fields is presented. The architecture was designed as general as possible trying to make no assumptions about the specific hardware platform to be used by the designers. The idea of using parallel strategies was considered in every design stage and implemented as much as hardware resources allowed us to do it so. The design results reported allow us to compute GF(2/sup 191/) elliptic curve scalar multiplication operations in about 114.7/spl mu/ Secs.