Timeline for Generation of strong primes
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 9, 2018 at 9:33 | history | bounty ended | Maarten Bodewes♦ | ||
| S Mar 9, 2018 at 9:33 | history | notice removed | Maarten Bodewes♦ | ||
| Mar 6, 2018 at 4:16 | comment | added | user94293 | You may look at "Fast generation of prime numbers on portable devices: An update" (CHES 2006), doi.org/10.1007/11894063_13, for efficient algorithms. | |
| Mar 5, 2018 at 18:19 | answer | added | fgrieu♦ | timeline score: 5 | |
| Mar 5, 2018 at 1:29 | history | tweeted | twitter.com/StackCrypto/status/970471287926743042 | ||
| Mar 4, 2018 at 23:23 | answer | added | Squeamish Ossifrage | timeline score: 5 | |
| S Mar 4, 2018 at 22:56 | history | bounty started | Maarten Bodewes♦ | ||
| S Mar 4, 2018 at 22:56 | history | notice added | Maarten Bodewes♦ | Draw attention | |
| Mar 4, 2018 at 22:55 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
deleted 9 characters in body
|
| Nov 30, 2014 at 21:02 | comment | added | fgrieu♦ | FIPS 186-4, appendix B.3 contains one of several possible definitions of strong prime, and methods to generate these. | |
| Nov 30, 2014 at 11:58 | comment | added | ddddavidee | This does not answer your questions but you might find it quite interesting. crypto.stackexchange.com/questions/15744/… I had the same question some time ago and find out, thanks to the answer, that is not necessary to use strong primes for large RSA keys. | |
| Nov 30, 2014 at 7:24 | history | asked | Boaz Shahar | CC BY-SA 3.0 |