Enhanced Montgomery Multiplication

Research output: Contribution to journalArticlepeer-review


We define the Non Reduced Montgomery Multiplication of order s, of A and B, modulo N (odd integer) by NRMMs(A,B,N) = (AB + N (-ABN-1 (mod 23s))) 2-s. Given an upper bound on A and B, with respect to N, we show how to choose the variable s in a way that guarantees that NRMMs(A,B,N) < 2N. A few applications are demonstrated, showing the advantage of using NRMMs with an appropriately chosen s, over the classical Montgomery Multiplication.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Enhanced Montgomery Multiplication'. Together they form a unique fingerprint.

Cite this