It will also make decrypted data meaningless. Regardless of if it's true or not.
For every encryption algorithm A that encrypts data D with key K that results in ciphertext C, there exists a completely different Algorithm / Key combo that will give your unencrypted data D. There are infinite inputs that equal every output and infinite outputs from every input.
Also what this means is that for every unencrypted data D that equals [0000 0000 0000 ... 0000 0000 0000] that's 100 GB in size, there exists an Algorithm / Key combo that will give you the entire MJ discography in lossless quality. (100 GB is just the number I used, could be 200, could be 90, could be 130, doesn't matter)
It means very fast data transfer.
My Ciphertext is X bits of all 0 and my algorithm is A394,791 with key Knigger
This will get you popeye's secret recipe.
What kind of AIDS is this font?
It will also make decrypted data meaningless. Regardless of if it's true or not.
For every encryption algorithm A that encrypts data D with key K that results in ciphertext C, there exists a completely different Algorithm / Key combo that will give your unencrypted data D. There are infinite inputs that equal every output and infinite outputs from every input.
Also what this means is that for every unencrypted data D that equals [0000 0000 0000 ... 0000 0000 0000] that's 100 GB in size, there exists an Algorithm / Key combo that will give you the entire MJ discography in lossless quality. (100 GB is just the number I used, could be 200, could be 90, could be 130, doesn't matter)
It means very fast data transfer.
>My Ciphertext is X bits of all 0 and my algorithm is A^394,791 with key K^nigger
>This will get you popeye's secret recipe.
What kind of AIDS is this font?
