jonesnc

I'm trying to find an article that was shared on HN recently that described different types of web applications and the recommended architecture to sue for each type (SPA, PWA, etc.)

I think the article also had a Greek-sounding title.

Thanks.

sha1 hashes are not secure, and collisions can be practically produced by attackers.

I'm wondering if these attack strategies could one day be used to find collisions for the pieces in a bittorrent archive to effectively "recover" the data that was originally used to create the bittorrent archive.

Let's say the piece size is 4 KiB, that means there are 2^(8x4x1024) possible combinations of bytes for each piece. That is a number with almost 10 thousand digits. Could these sha1 collision attack strategies be used to cut down on the number of combinations we'd have to comb through to find the matching 4 KiB of binary that original produced the hash?

Either way, I'm interested to learn more about how this works. Thanks.