[Cryptography] Creating a Parallelizeable Cryptographic Hash Function
waywardgeek at gmail.com
Mon Oct 6 18:46:16 EDT 2014
On Mon, Oct 6, 2014 at 6:23 PM, Bill Cox <waywardgeek at gmail.com> wrote:
> Simply compute:
> Digest = H(N || H(H(1 || B1) * H(2 || B2) * ... * H(n || Bn) mod p))
In case it's not obvious to Tom or anyone not familiar with modulo
arithmetic, this hash function can be updated in constant time by keeping
track of the Digest, as well as the mod p result. Just multiply the old
mod p result by the multiplicative inverse of the H value that changed, and
then multiply by the new H value mod p, and recompute the digest.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cryptography