[Cryptography] List of Proven Secure Ciphers / Hashes

grarpamp grarpamp at gmail.com
Mon Sep 15 02:44:09 EDT 2014


On Sun, Sep 7, 2014 at 11:01 AM, Lodewijk andré de la porte
<l at odewijk.nl> wrote:
> There's proofs with the right assertions, which is all proofs usually are.

> What would proving AES even mean? Did anyone ever prove a cipher to be
> secure? I guess you could construct a symetric cipher from asymetric crypto,
> copypaste proof that asserts the security of the underlying problem (and
> probably P!=NP) and call it a day.

So what is seemed to be said in all is that all of crypto (besides good
XOR) is based entirely on rather fantastical problems we don't know
how to solve today, yet whose solution might appear from some savant
literally tomorrow. (A seemingly quite laughable thing to base
crypto on.)

Alternatively, are there classes of solutions that we have proofed
unlikely to appear within some equivalent bit depth of hardness?
ie: solving problem x (which would break the crypto) is thought to
be at least as hard, or as unlikely to appear, as 2^128.

[x being some problem like efficient factoring]

[Note 'likelihood' could mean not just a singular solution but a
dependency chain of yet to be discovered maths such that discovering
all of them necessary for a break would be likely to be constrained
according to the historical time (mod progression) needed for major
discoveries. Also similar to Drake's calculating odds of intelligent
life in the universe... you can't proof the answer directly, but
you can be reasonably certain within given estimation.]


More information about the cryptography mailing list