Re: A new, fast and "unbreakable" encryption algorithm

From: Pavel Machek
Date: Thu Dec 03 2015 - 17:35:26 EST


Hi!

> 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

Trouble is... it is hard to prove your encryption can not be broken,
but it is very easy to prove your encryption _can_ be broken. (*)

And it looks like Clemens did just that:

> > Anyway, I tried to modify your program to encrypt a large message
> > consisting only of zero bytes. The result did not look random.

Sorry.

Pavel
(*) And no, those pictures don't really prove anything.
--
(english) http://www.livejournal.com/~pavelmachek
(cesky, pictures) http://atrey.karlin.mff.cuni.cz/~pavel/picture/horses/blog.html
--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/