[lkml]   [2015]   [Dec]   [3]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: A new, fast and "unbreakable" encryption algorithm

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?


On Fri, Dec 4, 2015 at 12:35 AM, Pavel Machek <> wrote:
> Hi!
>> Check this out please; just visual proofs: Better than thousands of lines:
> 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)
> (cesky, pictures)

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