An FPGA Arithmetic Logic Unite for Computing Scalar Multiplication Using the Half-and-Add Method
S. Mercurio Hernandez Rodriguez, Francisco Rodríguez‐Henríquez · 2006
In this paper, an FPGA arithmetic logic unit architecture for computing elliptic curve scalar multiplication over the binary extension field GF(2/sup 163/) is presented. The proposed architecture implements a parallel version of the half-and-add method using the mixed-coordinate representation for point addition, point doubling and point halving primitives. This way, our design can perform elliptic curve point addition, point doubling and point halving efficiently in terms of area resources and timing performance. Our experimental results show that our proposed design can perform an elliptic curve scalar multiplication in about 25/spl mu/s.