[Cryptography] Creating a Parallelizeable Cryptographic Hash Function

[David Leon Gil]

On Thu, Oct 2, 2014 at 6:53 PM, Jason Resch <jresch at cleversafe.com> wrote:
> Assuming there was a secure cryptographic function H() with an output of L
> bits, what attacks or weaknesses would exist in a protocol that did the
> following:

You're probably better off using a construction that has been designed
to be a sound "tree hashing" mode. E.g., the Keccak team's Sakura tree
hash coding: http://keccak.noekeon.org/Sakura.pdf