Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1753000AbbLCWfX (ORCPT ); Thu, 3 Dec 2015 17:35:23 -0500 Received: from atrey.karlin.mff.cuni.cz ([195.113.26.193]:37967 "EHLO atrey.karlin.mff.cuni.cz" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1751228AbbLCWfV (ORCPT ); Thu, 3 Dec 2015 17:35:21 -0500 Date: Thu, 3 Dec 2015 23:35:18 +0100 From: Pavel Machek To: Ismail Kizir Cc: Clemens Ladisch , linux-kernel@vger.kernel.org Subject: Re: A new, fast and "unbreakable" encryption algorithm Message-ID: <20151203223518.GF14427@amd> References: <564CA86C.1000402@skogtun.org> <564D90CF.4080100@ladisch.de> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: User-Agent: Mutt/1.5.23 (2014-03-12) Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 946 Lines: 25 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@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/