We are currently developing a GF(2^m) crypto-processor using normal basis. The tools and codes (compilers, vhd files for FPGA devices as well as maple codes) may be available at the end of my thesis (probably december). Don't hesitate to contact me if you want any further details.

Publications :

1. ISVLSI 2015 : Small Multiplication-Inversion Unit for Normal Basis Representation in GF(2^m) (Jérémy Métairie, Arnaud Tisserand and Emmanuel Casseau) ISVLSI 2015 Website
2. Poster presentation at the SOC-SIP GDR symposium (2014) : "Analyse d'opérateurs d'inversion dans GF(2^m) : compromis surface & vitesse".

Submitted :

1. Elliptic Curve Scalar Multiplication over GF(2ˆm) using Parallel Halving Method on FPGA