From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1758073AbbKSJFe (ORCPT ); Thu, 19 Nov 2015 04:05:34 -0500 Received: from smtprelay06.ispgateway.de ([80.67.31.101]:59343 "EHLO smtprelay06.ispgateway.de" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1757047AbbKSJF3 (ORCPT ); Thu, 19 Nov 2015 04:05:29 -0500 Subject: Re: A new, fast and "unbreakable" encryption algorithm To: Ismail Kizir References: <564CA86C.1000402@skogtun.org> Cc: linux-kernel@vger.kernel.org From: Clemens Ladisch Message-ID: <564D90CF.4080100@ladisch.de> Date: Thu, 19 Nov 2015 10:05:19 +0100 User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:38.0) Gecko/20100101 Thunderbird/38.3.0 MIME-Version: 1.0 In-Reply-To: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Df-Sender: bGludXgta2VybmVsQGNsLmRvbWFpbmZhY3Rvcnkta3VuZGUuZGU= Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org 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