Now that I think about it, since length extension attacks are a thing for Merkle–Damgård hashes, if a hash suddenly became vulnerable just because you added zeros to its input, then you could break any hash just by performing an LE attack and adding zeros to it! Obviously you cannot take a hash with an unknown input, append a bunch of zeros and hash it again, and then break the new hash to discover the previous hash's input. That proves that this is not a cryptographic issue in the slightest. — forest 5 mins ago
I tried to create a bmp file, like this:
uint8_t raw_r[pixel_width][pixel_height];
uint8_t raw_g[pixel_width][pixel_height];
uint8_t raw_b[pixel_width][pixel_height];
uint8_t blue(uint32_t x, uint32_t y)
{
return (rand()%2)? (x+y)%rand() : ((x*y%1024)%rand())%2 ? (x-y)%rand() : rand();...
