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
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
Which values occur exactly three times?
5245 Solvers
-
Matrix indexing with two vectors of indices
780 Solvers
-
279 Solvers
-
Split bread like the Pharaohs - Egyptian fractions and greedy algorithm
97 Solvers
-
Convert given decimal number to binary number.
2344 Solvers
More from this Author63
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
David, can you explain what do you mean by intermediate products?
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.