Timeline for Why do cryptographers need loads of true random numbers?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 13, 2019 at 9:23 | vote | accept | Paul Uszak | ||
| Aug 30, 2018 at 10:43 | history | edited | Paul Uszak | CC BY-SA 4.0 |
Direct lin k added to 300Gbps TRNG.
|
| Aug 30, 2018 at 6:36 | answer | added | David Johnston | timeline score: 2 | |
| Oct 25, 2016 at 21:50 | comment | added | Paul Uszak | So even with the above increased and now hugely exorbitant requirements(!) you could generate the 256 bits in a little less than 0.9ns. | |
| Oct 25, 2016 at 18:10 | history | tweeted | twitter.com/StackCrypto/status/790978845247672320 | ||
| Oct 25, 2016 at 7:26 | answer | added | Luis Casillas | timeline score: 3 | |
| Oct 25, 2016 at 7:10 | comment | added | CodesInChaos | As a side-note: 128 bits is cutting it a bit low, especially if you don't have any measures to prevent multi-target attacks. I'd recommend going with 256 bits. | |
| Oct 25, 2016 at 7:03 | answer | added | fgrieu♦ | timeline score: 4 | |
| Oct 25, 2016 at 4:45 | answer | added | otus | timeline score: 5 | |
| Oct 25, 2016 at 1:30 | answer | added | linuxdev2013 | timeline score: -2 | |
| Oct 25, 2016 at 0:58 | history | asked | Paul Uszak | CC BY-SA 3.0 |