New answers tagged

1

No, any simple identity like that would violate the cryptographic properties that BLAKE3 aims to have. Finding these cases is supposed to require a brute force search. BLAKE3 is a Merkle tree, but it isn't constructed by XORing things together. Instead, parent nodes in the tree are constructed by concatenating the hashes ("chaining values") of each ...


1

Of course, there should be infinitely many pairs. Finding one, however, should be infeasible for a polynomially bounded adversary. Blake3 is expected to have pre-image resistance, secondary pre-image resistance, and collision resistance with 256-bit, 256-bit, and 128 bits of security, respectively. The obvious method to find one is to select a random pair $(...


Top 50 recent answers are included