Extreme Compression

Forum Attachments

Extreme Compression

calccrypto 09 Aug 2008 02:23

I was wondering if there is any compression algorithm that not only compresses with binary, but also compresses without any other sideline tables, lists, matrices, strings etc. i want to compress a string of any length (a multiple of some number) into a ridiculously small fixed sized string of only 0s and 1s (like a 32/1024/512 char string to, say, 8 char string) so that even if fed through a program that can decompress it (like itself), will not know how many times to decompress it without the correct key (affecting everything in the string at the same time,like a hash function [but while being uncompressed instead of being compressed]).

RLE and Huffman/Hoffman or whatever his name is, tell the computer how to decompress the string properly. is there any way to decompress a string indefinitely without the computer realizing that it hit the correct decompression(unless given the correct key)?

is this even possible?

i dont know if this makes sense, so if you dont get something, just ask.

---

Visit Calccrypto for info on crypto
KC2ZOF

Last edited on 09 Aug 2008 03:23 by calccrypto Show more

Re: Extreme Compression

DarkerLine 09 Aug 2008 03:27

Using compression for encryption isn't a good idea. Also, except for very unlikely cases, compressing data multiple times won't achieve anything useful (and will probably make the result larger).

Moreover, you can't compress a string of any length into a "ridiculously small" string, because there's only a small number of ridiculously small strings, each of which can only decompress into one source string. Even with your repeated compression idea, all you're achieving is storing part of the information in the key. There's a very important point here: there is NO magic compression algorithm that is always successful. Any algorithm which makes some data smaller will have to make some data larger, to compensate (popular algorithms are useful, because they work well for very likely data, like a string of text, and poorly for unlikely data, like random noise).

Any compression algorithm can be modified to compress a string into another string of 0s and 1s. That's not very effective, though (only one bit of data per byte of string size) and using "sideline" lists or matrices is likely better and faster.

Re: Extreme Compression

calccrypto 09 Aug 2008 11:58

so there's no way to do it?

oh well. at least i know now.

---

Visit Calccrypto for info on crypto
KC2ZOF