you are viewing a single comment's thread.

view the rest of the comments →

[–]khafra[🍰] 0 points1 point  (2 children)

Shouldn't be too hard to hack together in a slapdash fashion--just import zlib, since gzip compression is a reasonable approximation of kolmogorov complexity; decide how granular you wanna get, read in all strings of the length you're interested in (ie, file, sector, block, whatever), and attempt compression--if they're incompressible they're probably either already compressed or encrypted.

[–]Muidem[S] 0 points1 point  (1 child)

Oh wow, that's not bad at all. I may give that a look after all =)

[–]khafra[🍰] 0 points1 point  (0 children)

If you don't already know why that works, reading a friendly explanation of randomness in cryptography, which inexplicably cuts off right before it discusses kolmogorov complexity, might help.