Hi guys,
Im not sure if I am allowed to ask this question here but its related to
Java so i hope so. I am going to write an encryption code with java but what i have to do first is an encryption and decryption "test" with RSA using p = 7, q = 11, e = 17 and ”plaintext” M = 8. ( i know that M is the secret message we wanna encrypt here)
I have understood so far that pq = n which is 77
n is one of the public keys
and getting the φ(n) totient i use Eulers function and get the answer 60
so i have n = 77, φ= 60 and e = 17 and M = 8
My ISSUE however is finding d!! In other words the private key. I know im supposed to use Euclids algorithm but i just dont get it. Ive read and tried like a million times, since yesterday and i cannot get it in to my head. I need easy instructions as it seems im a total brain dead person when it comes to maths
I need to use this type of calculation later on in a java code so I really need to understand how i encrypt.
IF anyone is used to this and willing to help id love if you could. A classmate said that the answer to d will be 53.
I just dont get how he got that number thouht....since i dont get euclids algorithm.
THanks in advance
