ملخص: The need often arises to compute the inverse of a number a in modulo arithmetics. Such a problem can be encountered, for example, when working with number-theoretic transforms (NTTs) (Marir, 1986; McClellan and Rader, 1979). It is shown, in this letter, how Euclid's algorithm can be used to compute the solution of the equation , where M is a prime number. The method presented here is an alternative implementation of the well-known Euclid's algorithm. %

لغة: إنجليزية