| | [p2p-hackers] security of variable block-length Merkle hash trees (SHA-1 vs. (SHA-512 % 2^160)) (Site not responding. Last check: 2007-10-30) |
 | | Let F2 be a string 48 bytes long, composed of two equal length > substrings s3 and s4. |
 | | That is, for F2, it is also true that: F2 urn:tree:tiger:ABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDABCDA I don't think it arises from the rule for "only child" node promotion, but rather the rule for that lets tree(algorithm,string)==algorithm(string) for length(string) |
 | | Still thinking about it, it shouldn't be too exploitable for malicious purposes -- the isomorphism is only between longer files, and their own just-short-of-root generation hash products -- but this could cause confusion if not patched up or documented as a problem/special case. |
| zgp.org /pipermail/p2p-hackers/2002-November/000993.html (539 words) |