Ismail Kizir wrote: > The essential logic of the algorithm is using the key as a "jump > table" which is dynamically updated with every "jump" we make.
Sounds like RC4. Please tell us how you are avoiding the weaknesses that make RC4 insecure. > Briefly, to decypher a ciphertext, a cracker needs to find out the > key, and, to find out the key, cracker needs to find out the > plaintext, because the key is dynamically updated according the > plaintext during encryption process: Impossible! That problem has been solved for a long time: https://en.wikipedia.org/wiki/Block_cipher_mode_of_operation Anyway, I tried to modify your program to encrypt a large message consisting only of zero bytes. The result did not look random. Regards, Clemens -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
