DOI QR코드

DOI QR Code

Improved Modular Inversion over GF(p)

  • Published : 2007.06.30

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