[Cryptography] Hierarchical bulk digest modes
jrzx at protonmail.ch
Wed Sep 15 16:09:35 EDT 2021
> Den tors 19 aug. 2021 01:54 Phillip 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?
On Sunday, August 22nd, 2021 at 3:34 AM, Natanael <natanael.l at gmail.com> wrote:
> 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.
Parchive already implements this solution.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cryptography