RSA核心运算使用的乘模算法就是 M(A*B)。虽然M(A*B)并不是乘模所需要的真正结果，但只要在幂模算法中进行相应的修改，就可以调用这个乘模算法进行计算了。本软件起初未使用Montgomery 乘模算法时，加密速度比使用Montgomery乘模算法慢，但速度相差不到一个数量级。

将上述乘模算法结合前面叙述的幂模算法，构成标准Montgomery幂模算法，即本软件所使用的流程

-RSA computation used by the core modulus algorithm is M (A* B). Although the M (A* B) is not required by the real-mode, but as long as the power modulus algorithm in the corresponding changes, you can call this by the calculated modulus algorithm. This software was initially not used by Montgomery modulus algorithm, the encryption faster than the use of Montgomery modulus algorithm by slow, but the speed was less than an order of magnitude. Modulus algorithm by the above described combination of the previous power-modulus algorithm, which constitute the standard Montgomery idempotent modulus algorithm, that is, the software used in flow