Timeline for Applications of Group Theory Which Motivate Theoretical Questions?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 29, 2015 at 19:18 | review | Late answers | |||
| Sep 30, 2015 at 5:48 | |||||
| Oct 20, 2013 at 16:35 | comment | added | KConrad | @algori: It is written in many places that Euler's theorem is used for RSA, but for the record it is not true. To show RSA works for all messages, not just those that are relatively prime to the modulus $pq$, Fermat's little theorem suffices. Look at the proof of correctness of the RSA algorithm at the end of the Wikipedia page on RSA. Using Euler's theorem instead of Fermat in that proof leaves uncertainty about messages having a factor in common with the modulus. Even though that is a very unlikely event, it's nice to know RSA would work even for those and the proof uses Fermat. | |
| Aug 17, 2011 at 18:52 | comment | added | Martin Brandenburg | Also, this was known long before real group theory was developed. The proof was implicitly group theoretic. You can understand it in every detail without knowing any group theory at all. So Lagrange is Overkill here. | |
| Feb 15, 2011 at 18:05 | comment | added | algori | none -- good point but just for the record: I think it's Euler's theorem, rather than Fermat's, that's used in public key cryptography (RSA). | |
| Feb 15, 2011 at 15:24 | history | made wiki | Post Made Community Wiki by S. Carnahan♦ | ||
| Feb 15, 2011 at 11:47 | history | answered | none | CC BY-SA 2.5 |