%0 Journal Article
%T High Performance Elliptic Curve GF(2m) Crypto-processor
%A Turki F. Al-Somani
%A M.K. Ibrahim
%A Adnan Gutub
%J Information Technology Journal
%D 2006
%I Asian Network for Scientific Information
%X This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers.
%K Elliptic curves cryptosystems
%K projective coordinate
%K parallel designs
%K normal basis
%U http://docsdrive.com/pdfs/ansinet/itj/2006/742-748.pdf