Suppose you know n = 1141367 is a product of two primes. A cryptographer is able to tell you that = 1136856. Find the two prime factors of n.
Follow Math Help Forum on Facebook and Google+
I think this might be a Euler's theorem problem? Any ideas??
Originally Posted by bigb I think this might be a Euler's theorem problem? Any ideas?? actually, it is an RSA problem let the primes be and note that and remember you have
So: But since: We have that: Should be easy from here. AH beaten
Originally Posted by o_O AH beaten that's right! Mr. o_O! oh! i see, bigb was referring to the Euler-Phi function. ok. never heard it called theorem before
nvm i got it...sry
Last edited by bigb; Sep 30th 2008 at 10:42 AM.
View Tag Cloud