MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayModular multiplicative inverse is used for *The Chinese Remainder Theorem* and *RSA algorithm*. You can visit Wikipedia.

**Normal Modulus**

X = M (mod Y)

You can solve that with M = mod(X,Y)

**Inverse Modulus**

X.B = M (mod Y)

given X,M,Y calculate B

B = inverse_modulus(X,M,Y)

Loading Solution Map...

1 Comment