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]

Date:	Wed, 18 Nov 2015 22:11:04 +0200
From:	Ismail Kizir <ikizir@...il.com>
To:	Harald Arnesen <harald@...gtun.org>
Cc:	linux-kernel@...r.kernel.org
Subject: Re: A new, fast and "unbreakable" encryption algorithm

Hello Harald,

I know that a lot of people thinks that there is a "new amateur in
town claiming having invented an unbreakable encryption" :)
That's why, I am trying to explain all my logic, publicly to professionals.
It's not rocket science. You will "just understand" when you read:

Until today, we were looking from the "wrong side" I guess.

We were all thinking that we must have a "fixed" key which must never change!

Why?

I begun to ask that question: "Why the key must be fixed?" and changed
the paradigm.

And I decided to dynamically update the key in encyption and decryption process.

The essential logic of the algorithm is using the key as a "jump
table" which is dynamically updated with every "jump" we make.

To understand better how it functions, suppose that we don't have a
complex function.

Given the key body length(L) is a power of 2, and M is an integer to
tell us where we are in the "key body":

We just take the byte at position M of the key body, we XOR that byte
with the byte to be encrypted(X).

We increase the byte at position M and "jump to" (M+X)%L

So, every time we encrypt a byte, we also change the key. It's a bit
more complicated than this. But essentially this is the base logic. In
real function, we do more complex operations with more variables like
the salt(or nonce) value, the last byte we encrypted, the key
checksum(against related key attacks) etc.

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!

I just want Linux uses a "strong encryption algorithm" to prevent
States, besides inalphabet kids, from reading your files :)

I believe this algorithm is the future of the encryption.

Source code: http://ismail-kizir.blogspot.com/2015/11/hohha-dynamic-xor-algorithm-source-code.html

Regards

On Wed, Nov 18, 2015 at 6:33 PM, Harald Arnesen <harald@...gtun.org> wrote:
> Ismail Kizir [2015-11-18 06:25]:
>
>> Hello,
>>
>> I've developed a new encryption algorithm, which dynamically changes
>> the key according to plaintext and practically impossible to break. I
>> also opened to public with MIT&GPL dual License.
>
> "There are two kinds of cryptography in this world: cryptography that
> will stop your kid sister from reading your files, and cryptography that
> will stop major governments from reading your files."
> - Bruce Scheier, Applied Cryptography
> --
> Hilsen Harald
--
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/