Skip to Main Content
Multiplicative inverse is a crucial operation in cryptographic systems; 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. We propose a new algorithm for calculating the inverse, based on continuous adding of two integer numbers and divide them result by the public key until an integer is obtained.
Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on (Volume:2 )
Date of Conference: 5-7 April 2004