[ (a/b)*c] mod n=k. If b,c,n,k values are known how can I get back a value provided the range of a,b is -(n-1) to n-1 and c is 0 to n-1 where n is a prime number.?
Asked
Active
Viewed 25 times
0
-
Isn't the value you're looking for $\equiv k \bmod n$? – mrnovice Feb 26 '17 at 15:34
-
not exactly.. i am looking for how modular reduction is performed when a number is multiplied and divided by some digits.. – sreenivas Feb 26 '17 at 15:38
-
yes b is coprime to n – sreenivas Feb 26 '17 at 15:51
-
You can compute it as $,acb^{-1}$ where $b^{-1}$ can be computed efficiently by the Extended Euclidean algorithm (or closely related methods). – Bill Dubuque Feb 26 '17 at 15:58