Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

Published June 29, 2003 | Version v1
Conference paper Open

Fraction-Integer Method (FIM): Calculating Multiplicative Inverse

Description

Multiplicative inverse is a crucial operation in cryptographic systems; public key cryptography has given rise to such a need [6], 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.

Files

FIM3.PDF

Files (170.9 kB)

Name Size Download all
md5:40b07f1a9d5f6b380db00fd7e8a7d590
170.9 kB Preview Download