Improved Modular Inversion over GF(p)
INTERNATIONAL JOURNAL OF CONTENTS / INTERNATIONAL JOURNAL OF CONTENTS, (P)1738-6764; (E)2093-7504
2007, v.3 no.2, pp.40-43
https://doi.org/10.5392/ijoc.2007.3.2.040
Choi, Jong-Hwa
(Dept. of Information Communication Engineering Chungbuk Naional University)
Kim, Yong-Dae
(Embedded Solution Co., Ltd)
Ahn, Young-Il
(Dept. of Information Communication Engineering Chungbuk Naional University)
You, Young-Gap
(School of Electrical & Computer Engineering Chungbuk National University)
Choi, Jong-Hwa,
Kim, Yong-Dae,
Ahn, Young-Il,
&
You, Young-Gap.
(2007). Improved Modular Inversion over GF(p). , 3(2), 40-43, https://doi.org/10.5392/ijoc.2007.3.2.040
Abstract
This paper proposed a new modular inverse algorithm based on the right-shifting binary Euclidean algorithm. For an n-bit numbers, the number of operations for the proposed algorithm is reduced about 61.3% less than the classical binary extended Euclidean algorithm. The proposed algorithm implementation shows substantial reduction in computation time over Galois field GF(p).
- keywords
-
Modular arithmetic,
Modular Inversion,
Cryptography