Physics Forums (http://www.physicsforums.com/index.php)
-   Linear & Abstract Algebra (http://www.physicsforums.com/forumdisplay.php?f=75)
-   -   Breaking RSA if you know m^k = 1 mod n (http://www.physicsforums.com/showthread.php?t=470083)

 nudan Feb5-11 11:04 AM

Breaking RSA if you know m^k = 1 mod n

Hello I'm looking for some guidance:

 robert Ihnot Feb6-11 11:48 PM

Re: Breaking RSA if you know m^k = 1 mod n

You seem to assume that everyone knows what you are talking about--why?

You certainly have not defined terms, but when I look into this, it is my impression that you have no understanding of modular arithmetic. Why not check that out?

 dhessler Feb11-11 02:52 PM

Re: Breaking RSA if you know m^k = 1 mod n

Look, RSA is built on the fact in the private key (d,n) and the public key (e,n) d and e are exponential inverses of each other mod n. If x^d or x^e are congruent to 1 then d = phi(n) or e = phi(n) respectively... Take a look at Euler's Theorem which is a generalize form of Fermat's Little Theorem. This is why in RSA there is so much care taken in picking keys.

 All times are GMT -5. The time now is 07:29 PM.