- P-ISSN1738-6764
- E-ISSN2093-7504
- KCI
ISSN : 1738-6764
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
Kim, Yong-Dae
Ahn, Young-Il
You, Young-Gap
Kim, Yong-Dae
Ahn, Young-Il
You, Young-Gap
Choi,,
J.
, Kim,,
Y.
, Ahn,,
Y.
, &
You,,
Y.
(2007). . , 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
- Downloaded
- Viewed
- 0KCI Citations
- 0WOS Citations