Abstract
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. © Springer-Verlag 2003.
Cite
CITATION STYLE
Gueron, S. (2003). Enhanced Montgomery Multiplication. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2523, 46–56. https://doi.org/10.1007/3-540-36400-5_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
