http://www.mapleprimes.com/questions/103970-Understanding-RSA en-us 2026 Maplesoft, A Division of Waterloo Maple Inc. Maplesoft Document System Thu, 11 Jun 2026 18:48:07 GMT Thu, 11 Jun 2026 18:48:07 GMT The latest answers and comments added to the Question, Understanding RSA http://www.mapleprimes.com/images/mapleprimeswhite.jpg http://www.mapleprimes.com/questions/103970-Understanding-RSA http://www.mapleprimes.com/questions/103970-Understanding-RSA?ref=Feed:MaplePrimes:Understanding RSA:Comments#answer103996 <p>That is how it works, there is nothing wrong with it.&nbsp;</p> <p>(p*q-1)^kpub mod n = (p*q-1) if n=p*q</p> <p>If your coded value was equal to n or p*q then your coded and encoded value should be 0.</p> <p>That is how it works, there is nothing wrong with it.&nbsp;</p> <p>(p*q-1)^kpub mod n = (p*q-1) if n=p*q</p> <p>If your coded value was equal to n or p*q then your coded and encoded value should be 0.</p> 103996 Sat, 09 Apr 2011 00:14:27 Z Christopher2222 Christopher2222 http://www.mapleprimes.com/questions/103970-Understanding-RSA?ref=Feed:MaplePrimes:Understanding RSA:Comments#answer104001 <p>When&nbsp; x = 0 or 1 mod n, or x = -1 mod n and k is odd, you'll always have x^k = x mod n.&nbsp; In fact x^k = x might have as many as k^2 solutions mod n.&nbsp; So there are a few messages that might be easy to decrypt.&nbsp; This is not usually a problem, because you're unlikely to want to send those messages.&nbsp; </p> <p>When&nbsp; x = 0 or 1 mod n, or x = -1 mod n and k is odd, you'll always have x^k = x mod n.&nbsp; In fact x^k = x might have as many as k^2 solutions mod n.&nbsp; So there are a few messages that might be easy to decrypt.&nbsp; This is not usually a problem, because you're unlikely to want to send those messages.&nbsp; </p> 104001 Sat, 09 Apr 2011 02:57:58 Z Robert Israel Robert Israel