linux-kernel - Re: A new, fast and "unbreakable" encryption algorithm

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

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <20151203223518.GF14427@amd>
Date:	Thu, 3 Dec 2015 23:35:18 +0100
From:	Pavel Machek <pavel@....cz>
To:	Ismail Kizir <ikizir@...il.com>
Cc:	Clemens Ladisch <clemens@...isch.de>, linux-kernel@...r.kernel.org
Subject: Re: A new, fast and "unbreakable" encryption algorithm

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@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/