Timeline for Why do the elliptic curves recommended by NIST use 521 bits rather than 512?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2023 at 3:46 | review | Suggested edits | |||
| Feb 7, 2023 at 10:59 | |||||
| S Jun 21, 2022 at 18:22 | history | suggested | Mime | CC BY-SA 4.0 |
Replaced hyperlink to link to the right wikipedia section
|
| Jun 21, 2022 at 13:59 | review | Suggested edits | |||
| S Jun 21, 2022 at 18:22 | |||||
| Oct 21, 2014 at 12:01 | comment | added | CodesInChaos | Primes of this form $2^n-1$ are known as Mersenne primes. | |
| Sep 22, 2014 at 0:32 | comment | added | Maarten Bodewes♦ | I do know that it's not fun to work with keys not on a byte boundary though. Brainpool curves have been designed to have all their parameters nicely on byte boundaries, including the highest curve being defined for 512 bit key sizes. | |
| Sep 19, 2013 at 23:40 | history | edited | e-sushi | CC BY-SA 3.0 |
Minimal reformatting.
|
| Feb 5, 2013 at 4:24 | vote | accept | Zack Elan | ||
| Feb 4, 2013 at 1:09 | history | tweeted | twitter.com/#!/StackCrypto/status/298236813443731456 | ||
| Feb 3, 2013 at 23:23 | answer | added | Barack Obama | timeline score: 33 | |
| Feb 3, 2013 at 23:05 | comment | added | CodesInChaos | I guess $2^{521}-1$ being prime was too nice to pass up. | |
| Feb 3, 2013 at 22:33 | review | First posts | |||
| Feb 6, 2013 at 13:44 | |||||
| Feb 3, 2013 at 22:14 | history | asked | Zack Elan | CC BY-SA 3.0 |