Modular multiplicative inverse is used for The Chinese Remainder Theorem and RSA algorithm. You can visit Wikipedia.
X = M (mod Y)
You can solve that with M = mod(X,Y)
X.B = M (mod Y)
given X,M,Y calculate B
B = inverse_modulus(X,M,Y)
MATLAB and Simulink resources for Arduino, LEGO, and Raspberry PiLearn more
Opportunities for recent engineering grads.Apply Today
New to MATLAB?Learn MATLAB today!
Play games and win prizes!Learn more