| lists.openwall.net | lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC | |
|
Open Source and information security mailing list archives
| ||
|
Message-ID: <CAFJyfaOt5LR=icYCszCui1KTMGebhNZfx9XoonHhUKZejK7y7w@mail.gmail.com> Date: Sat, 21 Nov 2015 08:31:28 +0200 From: Ismail Kizir <ikizir@...il.com> To: Clemens Ladisch <clemens@...isch.de> Cc: linux-kernel@...r.kernel.org Subject: Re: A new, fast and "unbreakable" encryption algorithm Hello Clemens, Check this out please; just visual proofs: Better than thousands of lines: http://ismail-kizir.blogspot.com.tr/2015/11/visual-proofs-of-hohha-dynamic-xor.html Regards Ismail Kizir On Thu, Nov 19, 2015 at 11:05 AM, Clemens Ladisch <clemens@...isch.de> 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: > 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 majordomo@...r.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Powered by blists - more mailing lists