[Cryptography] List of Proven Secure Ciphers / Hashes

[Stephan Neuhaus]

On 2014-09-09 20:17, R. Hirschfeld wrote:
> on crypto practice.  It depends on the nature of the proof.  If it's
> by giving a practical efficient poly-time algorithm for an NP-complete
> problem, that's a game changer.

Apart from all the things Peter has already said, the "practical, 
efficient" bit is the (often left-out) key here.  It may be that P=NP, 
but if the exponent is something ridiculous, like 10^10^10^10, even the 
most efficient implementation in the world wouldn't crack RSA-2048 any 
time soon, and you're faster with the (non-poly-time) general number 
field sieve.

Fun,

Stephan