High-speed VLSI design for Montgomery inverse over GF(2m)

Montgomery inversion algorithm has demonstrated its applicability in applications, such as computing point operations in the elliptic curve cryptography. By modifying the conventional Montgomery inversion algorithm, This work presents an efficient inversion algorithm over Galois field GF(2^m), which is very suited for hardware implementation. Due to its structural simplicity, the modified algorithm can be easily mapped onto a high-speed and possibly low-complexity circuit. Results show that a significant performance improvement can be achieved in comparison with previous work, especially for applications of cryptosystems.