How to find errors in solving for RSA Algorithm?

50 Views Asked by At

I'm working on an assignment, where we are given the values of p, q, and e.

I have p = 11, q = 67, and e = 373. I've calculated n = p * q = 737 and φ = (p-1) * (q-1) = 660.

.

I found a d such that e * d mod φ = 1 using Bezout's Identity, d = 637. However, this d does not appear to work.

M = 65, C = M^e mod n = 153

Decoding, C = 153, M' = C^d mod n = 607, which is not equal to 65.

.

I don't understand where I'm making a mistake, and why the coding doesn't work. Am I using the wrong equations? (Here is the calculator I used: comptune calculator).

1

There are 1 best solutions below

1
On

Check the calculator being used for computations.

The calculations for d were, in fact, correct. The problem was either with the calculator (comptune) or its use. I did not have the same problem with WolframAlpha calculator.