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

On 2015-12-04 04:42, Ismail Kizir wrote: Clemens, You really don't know what you are talking about. Don't you? :) And this is my last mail about the subject. I don't want to keep the list busy. The original, unencrypted "plaintext" file was all zeroes. When I uploaded to blogspot, it appeared

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

Clemens, You really don't know what you are talking about. Don't you? :) And this is my last mail about the subject. I don't want to keep the list busy. The original, unencrypted "plaintext" file was all zeroes. When I uploaded to blogspot, it appeared all "red" and it still is. And it has not

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

Clemens, You really don't know what you are talking about. Don't you? :) And this is my last mail about the subject. I don't want to keep the list busy. The original, unencrypted "plaintext" file was all zeroes. When I uploaded to blogspot, it appeared all "red" and it still is. And it has not

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

On 2015-12-04 04:42, Ismail Kizir wrote: Clemens, You really don't know what you are talking about. Don't you? :) And this is my last mail about the subject. I don't want to keep the list busy. The original, unencrypted "plaintext" file was all zeroes. When I uploaded to blogspot, it appeared

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

Ismail Kizir wrote: > What means "did not look random"? A plaintext consisting of repeated bytes (zero, or other values) eventually makes your algorithm go into a loop, which results in repeated bytes. > On the pictures, there is also an example of "full 0"(it appears red, > but it is full 0

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

Pavel, What means "did not look random"?? On the pictures, there is also an example of "full 0"(it appears red, but it is full 0 bmp) example. And it "looks" perfectly random. What are trying to do with your baseless allegations? Ismail On Fri, Dec 4, 2015 at 12:35 AM, Pavel Machek wrote: >

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

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

Ismail Kizir wrote: > What means "did not look random"? A plaintext consisting of repeated bytes (zero, or other values) eventually makes your algorithm go into a loop, which results in repeated bytes. > On the pictures, there is also an example of "full 0"(it appears red, > but it is full 0

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

Pavel, What means "did not look random"?? On the pictures, there is also an example of "full 0"(it appears red, but it is full 0 bmp) example. And it "looks" perfectly random. What are trying to do with your baseless allegations? Ismail On Fri, Dec 4, 2015 at 12:35 AM, Pavel Machek

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

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

Hello Clemens, 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 Regards Ismail Kizir On Thu, Nov 19, 2015 at 11:05 AM, Clemens Ladisch wrote: > Ismail Kizir wrote: >> The essential

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

Hello Clemens, 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 Regards Ismail Kizir On Thu, Nov 19, 2015 at 11:05 AM, Clemens Ladisch wrote: > Ismail Kizir wrote:

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

Lukasz, Clemens, Herald, Others Linux and Open Source Enthusiasts: You are all invited to collaboratively improve our encryption algorithm at: https://github.com/ikizir/HohhaDynamicXOR Write down every weaknesses you find, every idea to improve; every code piece you think necessary. Let us not

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

It was <2015-11-19 czw 13:31>, when Ismail Kizir wrote: > On Thu, Nov 19, 2015 at 2:12 PM, Łukasz Stelmach > wrote: >> It was <2015-11-18 śro 06:25>, when Ismail Kizir wrote: >>> Hello, >>> >>> I've developed a new encryption algorithm, which dynamically changes >>> the key according to

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

Francly Lucasz, I am not an expert and never claimed it. And I accept it's vulnerable to side channel attacks like the one you mentioned. With this occasion, I want to emphasize one point: I don't claim that the my algorithm is perfect. But, take a look at this: But, I am sure, this "dynamic key

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

It was <2015-11-18 śro 06:25>, when Ismail Kizir wrote: > Hello, > > I've developed a new encryption algorithm, which dynamically changes > the key according to plaintext and practically impossible to break. [...] > I will be glad to see my algorithm included in Linux distributions. > Please feel

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

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

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

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

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

It was <2015-11-18 śro 06:25>, when Ismail Kizir wrote: > Hello, > > I've developed a new encryption algorithm, which dynamically changes > the key according to plaintext and practically impossible to break. [...] > I will be glad to see my algorithm included in Linux distributions. > Please feel

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

Francly Lucasz, I am not an expert and never claimed it. And I accept it's vulnerable to side channel attacks like the one you mentioned. With this occasion, I want to emphasize one point: I don't claim that the my algorithm is perfect. But, take a look at this: But, I am sure, this "dynamic key

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

Lukasz, Clemens, Herald, Others Linux and Open Source Enthusiasts: You are all invited to collaboratively improve our encryption algorithm at: https://github.com/ikizir/HohhaDynamicXOR Write down every weaknesses you find, every idea to improve; every code piece you think necessary. Let us not

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

It was <2015-11-19 czw 13:31>, when Ismail Kizir wrote: > On Thu, Nov 19, 2015 at 2:12 PM, Łukasz Stelmach > wrote: >> It was <2015-11-18 śro 06:25>, when Ismail Kizir wrote: >>> Hello, >>> >>> I've developed a new encryption algorithm, which dynamically changes >>> the

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

I am not a cyrptoanalyst, not a mathematicien. But, I wanted to enumerate some facts about "The Hohha Dynamic XOR Encryption" algorithm I mentioned earlier. My algorithm is "fundamentally different" from classical encryption methods, because, it dynamically "encrypts" the key itself "during a

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,

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

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 dual License. "There are two kinds of cryptography in this world:

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

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 dual License. "There are two kinds of cryptography in this world:

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,

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

I am not a cyrptoanalyst, not a mathematicien. But, I wanted to enumerate some facts about "The Hohha Dynamic XOR Encryption" algorithm I mentioned earlier. My algorithm is "fundamentally different" from classical encryption methods, because, it dynamically "encrypts" the key itself "during a

A new, fast and "unbreakable" encryption algorithm

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 dual License. It is also quite fast; ~80% faster than the fastest mode of AES without cpu instruction set support. I

A new, fast and "unbreakable" encryption algorithm

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 dual License. It is also quite fast; ~80% faster than the fastest mode of AES without cpu instruction set support. I