| 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
| ||
|
Date: Fri, 4 Dec 2015 08:34:13 +0100 From: Clemens Ladisch <clemens@...isch.de> To: Ismail Kizir <ikizir@...il.com> Cc: Pavel Machek <pavel@....cz>, linux-kernel@...r.kernel.org Subject: 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 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 -- 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/
Powered by blists - more mailing lists