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