[Cryptography] Hierarchical bulk digest modes

[Natanael]

Den tors 19 aug. 2021 01:54Phillip Hallam-Baker <phill at hallambaker.com>
skrev:

> Traditionally, a digest converts a sequence of bits to a fixed
> length output
>
> M(d) -> 256 bits
>
> We can now detect a single bit of corruption in the data file. Great! But
> that doesn't give us any information if the data is corrupted. We don't
> know where the corruption occurred. That is fine for little files but what
> about when we are dealing with 1TB archives?
>

Don't make it complicated. Just throw in ordinary error correction codes.

A Merkle tree hash may also be helpful for several reasons, besides those
previously mentioned it would also be more tolerant to transient errors
during computation.

>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://www.metzdowd.com/pipermail/cryptography/attachments/20210822/0044de61/attachment.htm>