바로가기메뉴

본문 바로가기 주메뉴 바로가기
 
 

logo

  • P-ISSN1738-6764
  • E-ISSN2093-7504
  • KCI

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)

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

INTERNATIONAL JOURNAL OF CONTENTS