Abstract - Multiplicative inverse is a crucial operation in public key cryptography, and been widely used in cryptography. Public key cryptography has given rise to such a need, in which we need to generate a related public and private pair of numbers, each of which is the inverse of the other. The basic method to find multiplicative inverses is Extended-Euclidean method. In this paper we will propose a new algorithm for computing the inverse, based on continues subtract fraction from integer and divide by fraction to obtain integer that will be used to compute the inverse d. The authors claim that the proposed method more efficient and faster than the existed methods. Keywords - Multiplicative inverse, greater common divisor, Euclidean method, Stein method, Gordon method, Baghdad method 1. Introduction Modular arithmetic plays an important role in cryptography. Many public-key schemes [2] involve modular exponentiation. Modular inversion, the computation of b −1 mod a has a part in exponentiation based on addition-subtraction chains [6], as well as other applications in such public key systems. The multiplicative inverse of
[1]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[2]
Alfred Menezes,et al.
Handbook of Applied Cryptography
,
2018
.
[3]
Donald Ervin Knuth,et al.
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
,
1978
.
[4]
S.J. Aboud,et al.
Baghdad method for calculating multiplicative inverse
,
2004,
International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..
[5]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.