Re: RSA Decryption method

are you sure it's not:

and

...?

Re: RSA Decryption method

Yes... unfortunately. I saw the and algorithm on wiki and was hoping to be guided through it from there.

Re: RSA Decryption method

because it looks like a computational shortcut using the chinese remainder theorem, but there's nothing involving the inverse of p2 mod p1.

Re: RSA Decryption method

If it helps, here is a walk-through that parallels the guided question. I completed all the steps but couldn't get the answer 10000 - perhaps I am misunderstanding part of it. I can't be sure which variables are which in my question. I found all the values that satisfied the equations successfully but completing the final computation gave me something different to .

Compute:

Compute:

Find:

and

Compute:

Finally compute:

Re: RSA Decryption method

well, see, that would work...if exponent1 and exponent2 were 103381 (mod p1-1) and 103381 (mod p2-1). are you working from a text, or from notes?

Re: RSA Decryption method

Method is from notes, question is from a handout.

So, in that case,

But a doesn't seem to be used :S

How would you find the message with your method and maybe I can extract what I need to do from that.

Re: RSA Decryption method