[cryptography] Weak random data XOR good enough random data = better random data?

Ryan Carboni ryacko at gmail.com
Wed Sep 3 19:18:09 EDT 2014

isn't the simplest solution would be to concatenate or XOR a counter?

Thus H[0] = Hash(input)
H[N] = Hash(H[N-1]+CTR)

considering that hashes from MD4 to SHA-2 all have block sizes of 512 bits,
much larger than their outputs, one could simply concatenate a 128-bit
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.randombit.net/pipermail/cryptography/attachments/20140903/619fdf5a/attachment.html>

More information about the cryptography mailing list