In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given
a and
[...] Read more.
In literature, there are a number of cryptographic algorithms (RSA, ElGamal, NTRU, etc.) that require multiple computations of modulo multiplicative inverses. In this paper, we describe the modulo operation and we recollect the main approaches to computing the modulus. Then, given
a and
n positive integers, we present the sequence
, where
,
and
. Regarding the above sequence, we show that it is bounded and admits a simple explicit, periodic solution. The main result is that the inverse of
a modulo
n is given by
with
. The computational cost of such an index
i is
, which is less than
of the Euler’s phi function. Furthermore, we suggest an algorithm for the computation of
using plain multiplications instead of modular multiplications. The latter, still, has complexity
versus complexity
(naive algorithm) or complexity
(extended Euclidean algorithm). Therefore, the above procedure is more convenient when
(e.g.,
).
Full article