High performance elliptic curve GF(2^m) crypto-processor

This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2^m). 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 (AT²) 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 AT² in parallel designs with the least number of multiplications levels when using 4 multipliers.