%0 Journal Article
%T Design of elliptic curve cryptoprocessors over GF(2^163) using the Gaussian normal basis
%A Jaime Velasco-Medina
%A Paulo Cesar Realpe
%A Vladimir Trujillo-Olaya
%J -
%D 2014
%X This paper presents the efficient hardware implementation of cryptoprocessors that carry out the scalar multiplication kP over finite field GF(2163) using two digit-level multipliers. The finite field arithmetic operations were implemented using Gaussian normal basis (GNB) representation, and the scalar multiplication kP was implemented using Lopez-Dahab algorithm, 2-NAF halve-and-add algorithm and w-tNAF method for Koblitz curves. The processors were designed using VHDL description, synthesized on the Stratix-IV FPGA using Quartus II 12.0 and verified using SignalTAP II and Matlab. The simulation results show that the cryptoprocessors present a very good performance to carry out the scalar multiplication kP. In this case, the computation times of the multiplication kP using Lopez-Dahab, 2-NAF halve-and-add and 16-tNAF for Koblitz curves were 13.37 ¦Ěs, 16.90 ¦Ěs and 5.05 ¦Ěs, respectively
%K elliptic curve cryptography
%K Gaussian normal basis
%K digit-level multiplier
%K scalar multiplication
%U https://revistas.unal.edu.co/index.php/ingeinv/article/view/40542