Improvement of Modular Inverse Algorithm on Finite Fields For Elliptic Curve Cryptosystem
XU Ci-wen · Zhongyang Minzu Daxue xuebao · 2009
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.