[lkml]   [2015]   [Nov]   [21]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: A new, fast and "unbreakable" encryption algorithm
Hello Clemens,

Check this out please; just visual proofs: Better than thousands of lines:

Ismail Kizir

On Thu, Nov 19, 2015 at 11:05 AM, Clemens Ladisch <> wrote:
> 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:
> 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

 \ /
  Last update: 2015-11-21 07:41    [W:0.060 / U:0.764 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site