I'm a little stuck trying to figure out how to decrypt some messages and could use some hints as to what I may be doing wrong.
I was given a series of integer values that make up my cipher text. Here are just a few of them:
6584 15650 16198 11003
I was given the following public key b = 3001 n = 18209
So to encrypt a message M, you would use the formula:
C = M^3001 mod 18209
I understand to encrypt, I need to find a 'd' value that satisfies:
bd = 1 mod 18209
3001d = 1 mod 18209
Any hints on a technique or algorithm to help me find a suitable value for 'd'?