Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A,B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is obtained by Mn(Mn(A,B), N −2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(·, ·) will replace directly each modular multiplicati...