lkml.org 
[lkml]   [2015]   [Dec]   [4]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRe: A new, fast and "unbreakable" encryption algorithm
From
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 any "red" cyphertext :)
http://ismail-kizir.blogspot.com.tr/2015/11/visual-proofs-of-hohha-dynamic-xor.html

On Fri, Dec 4, 2015 at 9:34 AM, Clemens Ladisch <clemens@ladisch.de> wrote:
> 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 bmp) example.
>> And it "looks" perfectly random.
>
> No, red is _not_ perfectly random. When I see a red picture, I have
> evidence that the plaintext was zeroes.
>
>
> Regards,
> Clemens


\
 
 \ /
  Last update: 2015-12-04 11:01    [W:0.057 / U:1.368 seconds]
©2003-2018 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site