I am trying to solve a question for my Number Theory / Intro To Cryptography class. I have been given a question to decrypt a message encoded with the RSA scheme. The encryption with done with a provided n, and e. I am told to compute the d, and to decrypt the message.
In order to compute d I need to compute
(n))
My issue is that to compute I need to factor n into its original two primes. But this is very hard when n is large (which it is). Is there an easier way to compute ?
Thanks
Thats what I figured ... Its okay I just wrote a computer program to factor the n which is relatively small... and then it was easy to calculate everything else out as e is provided!
I just wanted to know if there is some other approach besides the brute force factoring .. which there isn't!