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 Solvers5
Suggested Problems
-
Project Euler: Problem 1, Multiples of 3 and 5
3731 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2584 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
228 Solvers
-
Find nearest prime number less than input number
1021 Solvers
-
137 Solvers
More from this Author65
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.