椭圆曲线加密体制的有限域求模逆算法的改进

Improvement of Modular Inverse Algorithm on Finite Fields For Elliptic Curve Cryptosystem

本文在整数的扩展欧几里德算法基础上,对椭圆曲线加密体制的有限域求模逆算法作出改进,不仅有效提高了运算速度,使之同时兼容二进制域和素数域,同时也利于硬件实现.

This paper improve a modular inverse algorithm on finite fields for Elliptic curve cryptosystem,that is built on Extended Euclid algorithm.The new algorithm not only runs faster than the old ones,but it can be used in two kinds of finite fields,which are Galois fields GF(p) and GF(2m).Furthermore more,it provides a great convenience for hardware realization.