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
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
583 Solvers
-
Sum the entries of each column of a matrix which satisfy a logical condition.
175 Solvers
-
Determine if input is a Narcissistic number
217 Solvers
-
Possible Outcomes of American Roulette
120 Solvers
-
Count consecutive 0's in between values of 1
517 Solvers
More from this Author61
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.