O.k., this is happening ... now. I'm going to explain what's actually going on when data is encrypted, hopefully without mystifying, oh and some of the weird and inconsistent stuff cryptographers come up with.https://twitter.com/colmmacc/status/1100976962846154752 …
Well a few things to clear up :) I don't think the hash Vs RNG distinction is that meaningful. Many RNGs use hashes, for example HMAC_DRBG, which is one of the best RNGs (imo). It's all just algorithms to create successive streams of random data, with a balance for perf.
-
-
Sure, just explains the part about how a short random bit of info gets turned into one that’s (approximately) the size of the data to encrypt. It demystified stuff for me a bit.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
PRNGs don't quite become more predictable the more you pull from them. Some of them just straight up cycle after a certain point, so you have to cut-off before the period. But mostly it's about how much data would it take to reverse engineer the initial conditions.
-
Rule of thumb I’ve heard is sqrt(period). Some CSPRNGs don’t have a closed form computable period though, but I think they usually have provable minimum bounds on period. Been a while.
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.