Problem 46636. Montgomery Multiplication

Created by David Hill
Appears in Advanced Cryptography Algorithms and Mathematics

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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).

Solve

Solution Stats

6 Solutions
3 Solvers

Last Solution submitted on Nov 11, 2022

Last 200 Solutions

Problem Comments

2 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 comments

ANNOUNCEMENT

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers3

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 46636. Montgomery Multiplication

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers3

Suggested Problems

More from this Author57

Problem Tags

Community Treasure Hunt

Problem 46636. Montgomery Multiplication

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Problem Recent Solvers3

Suggested Problems

More from this Author57

Problem Tags

Community Treasure Hunt

Players