Montgomery's modular multiplication algorithm is commonly used in implementations of the RSA cryptosystem. It has been observed that there is no need for extra cleaning up at the end of an exponentiation if the method is correctly set up.
No takes yet. Share an insight, caveat, or question.
Colin D. Walter (1999) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: