Theoretical vs. practical cryptography in the kernel
Theoretical vs. practical cryptography in the kernel
Posted Aug 14, 2020 7:21 UTC (Fri) by kleptog (subscriber, #1183)In reply to: Theoretical vs. practical cryptography in the kernel by robert.cohen@anu.edu.au
Parent article: Theoretical vs. practical cryptography in the kernel
I also think the issue is way overblown. So 32-bits of this fast pool are used elsewhere. Even if they were completely exposed, it doesn't help you with the other 96-bits and they are eventually mixed even more before being fed to the actual pool.
If you require that all inputs to your random number generator be verifiably random then you have set your goals impossibly high as the article states. Entropy is a theoretical measure, there is no actual way to determine how random something actually is. You'd need to examine the entire multiverse and count the number of universes which are (apparently) identical except for those bits. A better approach seems to me to collect as much unpredictable data as you can and keep on mixing. Estimating the actual randomness is (IMHO) a fool's game.
Posted Aug 16, 2020 4:36 UTC (Sun)
by rahvin (guest, #16953)
[Link]
Posted Aug 31, 2020 11:52 UTC (Mon)
by cpitrat (subscriber, #116459)
[Link]
Hold my beer ...
Theoretical vs. practical cryptography in the kernel
Theoretical vs. practical cryptography in the kernel
