lkml.org 
[lkml]   [2015]   [Dec]   [3]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
SubjectRe: A new, fast and "unbreakable" encryption algorithm
From
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 <pavel@ucw.cz> wrote:
> 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


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