Abstract: The finite field arithmetic is the base of cryptography and modular inversion is the kernel arithmetic operation. The authors present a dual field modular inversion algorithm. The 256-bit inversion circuit based on the proposed algorithm can be used at the 167MHz clock frequency. It also has an improvement in area complexity compared with other designs.

Key words: finite fields, modular inversion, Euclidean algorithm

摘要： 有限域的运算是密码学的基础，而在有限域的所有运算中模逆运算是最核心也是最复杂的运算。提出了一种同时支持素域和二进制域两种有限域的模逆算法，通过对算法的优化和对硬件结构的设计，使得256位的模逆运算电路的时钟频率达到167MHz，电路面积和其他电路相比较也有明显优势。

关键词: 有限域, 模逆运算, Euclidean算法