Problem 46636. Montgomery Multiplication
Multiply all elements of an input matrix (A) modulo N, given all elements are less than R (2^number of bits). Where gcd(R,N)=1 and N<R. Output the final result, P (in normal form) and all intermediate products (p) in Montgomery form (first product is just first element of matrix (A)*R modulo N).
Solution Stats
Problem Comments
-
2 Comments
Dyuman Joshi
on 1 Aug 2022
David, can you explain what do you mean by intermediate products?
cokakola
on 11 Nov 2022
I had to create the needed elements of p, they did not exist es intermediate results. Well, they exist, but not in the right form.
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
2563 Solvers
-
4445 Solvers
-
How long is the longest prime diagonal?
393 Solvers
-
Is the paranthesis sequence balanced ?
163 Solvers
-
Give me Hamming on five, hold the mayo
48 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!