Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > linux.kernel > #1274607
| From | Ismail Kizir <ikizir@gmail.com> |
|---|---|
| Newsgroups | linux.kernel |
| Subject | Re: A new, fast and "unbreakable" encryption algorithm |
| Date | 2015-11-21 07:40 +0100 |
| Message-ID | <qxa01-1yc-3@gated-at.bofh.it> (permalink) |
| References | <qw3tD-6X3-3@gated-at.bofh.it> <qwdW2-5qI-13@gated-at.bofh.it> <qwhmV-7QW-1@gated-at.bofh.it> <qwto6-7iI-1@gated-at.bofh.it> |
| Organization | linux.* mail to news gateway |
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@ladisch.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@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
Back to linux.kernel | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-18 06:30 +0100
Re: A new, fast and "unbreakable" encryption algorithm Harald Arnesen <harald@skogtun.org> - 2015-11-18 17:40 +0100
Re: A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-18 21:20 +0100
Re: A new, fast and "unbreakable" encryption algorithm Clemens Ladisch <clemens@ladisch.de> - 2015-11-19 10:10 +0100
Re: A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-21 07:40 +0100
Re: A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-19 03:40 +0100
Re: A new, fast and "unbreakable" encryption algorithm Łukasz Stelmach <l.stelmach@samsung.com> - 2015-11-19 13:20 +0100
Re: A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-19 13:40 +0100
Re: A new, fast and "unbreakable" encryption algorithm Łukasz Stelmach <l.stelmach@samsung.com> - 2015-11-19 15:10 +0100
Re: A new, fast and "unbreakable" encryption algorithm Ismail Kizir <ikizir@gmail.com> - 2015-11-19 15:10 +0100
csiph-web