[Cryptography] A new, fast and "unbreakable" encryption algorithm

Perry E. Metzger perry at piermont.com
Thu Nov 19 10:13:53 EST 2015


On Thu, 19 Nov 2015 02:25:51 +0200 Ismail Kizir <ikizir at gmail.com>
wrote:
> And another important point to mention:

I think we're calling a halt to this.

Sorry, Mr. Kizir, but people who think they've invented superior
encryption algorithms show up out of the woodwork about every fifteen
minutes. Generally these people don't provide (say) proofs of the
resistance of their work to linear and differential cryptanalysis or
an explanation of why they selected the number of rounds they did in
order to meet some security criterion, and they certainly don't
describe their work in terms of reasonable attacks on similar systems.
Instead they're at best friendly amateurs wading in to water that
is deeper than they think, and at worst they're sometimes the sort of
people one finds on the internet proclaiming that they can
demonstrate that Einstein was wrong or who have a definitive proof
showing how to square the circle.

I will be kind and presume that you're the former sort and not the
latter, and recommend that if you're really interested in the field
you spend a few years studying it in depth. Of course, at that point
you will probably realize the world has plenty of good encryption
algorithms already and it is very rare that it needs new ones -- the
problems we actually face are different.

And for now, I'm banning further discussion of this.

Perry
-- 
Perry E. Metzger		perry at piermont.com


More information about the cryptography mailing list