Timeline for What is the use of Mersenne Primes in cryptography
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 22, 2014 at 19:56 | comment | added | Stephen Touset | @poncho has a great point. Mersennes can be useful when you need a non-secret prime number that is fast to compute modulo on. | |
| Oct 22, 2014 at 19:15 | history | answered | Stephen Touset | CC BY-SA 3.0 |