Fraction-Integer Mehod (FIM) for Calculating Multiplicative Inverse

Abstract

Multiplicative inverse is a crucial operation in public key cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public/private pair of numbers, each of which is the inverse of the other. One of the best methods for calculating the multiplicative inverse is Extended-Euclidean method. In this paper we will propose a new algorithm for calculating the inverse, based on continuous adding of two fraction numbers until an integer is obtained.

Keywords

• Cryptography
• Greater Common Divisor
• Fraction-Integer Method
• Multiplicative Inverse