4 ms·
How big problem is this in practice? Let's say you only have 256 bits of "real entropy" and you then stretch that into large amounts of pseudo-random bits using
by im3w1l 11y ago
How big problem is this in practice? Let's say you only have 256 bits of "real entropy" and you then stretch that into large amounts of pseudo-random bits using a state of the art CSPRNG and use those bits for all your randomness needs. Let's say worst case scenario here, so a server that is online for several years, with no reseeding at all. Are there any practical attacks against that?
- marcosdumay 11y agoIf you stretch it into a set of numbers with 256 bits or less, you are good. If you expect to generate bigger random numbers from it, you have a problem. But the pool does not stay with only 256 bits for long (if at all). It's always accumulating more. Anyway, if the pool ever get to zero, it means that an attacker with infinite resources that can see the entire sequence generated by the CSPRNG could predict the next numbers it'll generate. On practice none of those conditions are met.
- Tomte 11y agoSo you don't trust modern block ciphers and avoid encrypting more than 128 (or 256) bits of data with a single key? Isn't that extreme key rotation a bit bothersome? No, stretching your seed of 256 bits into terabytes of pseudorandom numbers is normal and absolutely fine.