The program calcs the multiplicative inverse of a number in mod m world. In mathematics, in particular the area of number theory, a modular multiplicative inverse of an integer a is an integer x such ...
a(i) is the result of b(i-1)%a(i-1) b(i) = a(i-1) y(i) = x(i-1) x(i) = y(i-1) - (b(i-1)/a(i-1)) * x(i-1) where i is the step number and (b/a) is the quotient b/a. Note that this number may be negative ...
Abstract: This paper presents new design and implementation for the inverse modulo (2 16 +1) multiplier to be used in the International Data Encryption Algorithm (IDEA) for key scheduling. The design ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback