I missed a whole load of lectures as I was ill and now I am behind on some work. I am trying to catch up but I have come across this question which I haven't got a clue how to do:
A public key code has base n = 564146777 and encoding exponent a = 282044381.
i) Factorize n and calculate ?(n)
ii) Calculate the decoding exponent x (i.e a^(-1) mod ?(n) )
iii) Decode the following received message using the letter to number equivalents in the attached table (p4). Each block corresponds to a sequence of one or two letters; thus, since 10 corresponds to A and 11 to B, 1011 stands for AB, etc.
366514996 / 506479715 / 239338918 / 85377691
For part one, I assumed factorizing it meant in terms of its primes and I got n = (45691)(46777) and so I got ?(n) to be 564088740.
Then I am completely stuck for part 2. I looked over the lecture notes and I don't have a clue what is going on. Could someone please either show me, or give me a real push (not nudge lol) in the right direction because I am really struggling with this. I am assuming that I should be able to do part 3 if I can do part 2, but if you could give me a tiny hint on how to do that I would much appreciate it.
Thank you very much
Turn on thread page Beta
I think this question is on congruences and RSA watch
- Thread Starter
- 03-04-2011 11:49
- 03-04-2011 13:55
So for part (ii) you need to find the inverse of a mod P (where P = ?(n)).
The extended Euclidean algorithm lets you find m and n s.t. 1 = ma + nP. But then 1=ma mod P, so m is an inverse for a.