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

Ryan Carboni ryacko at gmail.com
Thu Sep 4 03:52:04 EDT 2014


Not really. At minimum it's 2^128 bytes. But it's probably closer to 2^160.


On Thu, Sep 4, 2014 at 12:37 AM, Givon Zirkind <givonne at gmx.com> wrote:

>  forgive me for jumping into the middle of the conversation.  but, if
> memory serves, such a scheme is limited to 2^128 bytes.  then, the counter
> repeats.  which causes redundancy, weakness in the hash.
>
>
> On 9/3/2014 7:18 PM, Ryan Carboni wrote:
>
>   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 counter.
>
>
>
>
> _______________________________________________
> cryptography mailing listcryptography at randombit.nethttp://lists.randombit.net/mailman/listinfo/cryptography
>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.randombit.net/pipermail/cryptography/attachments/20140904/9a03140e/attachment.html>


More information about the cryptography mailing list