Monthly Archives: May 2014

Proving the security of an encryption algorithm

Technically speaking, it’s impossible to prove the security of any encryption algorithm. As long as it’s unknown whether P is equivalent to NP, we have no idea of the problems that encryption algorithms depend on for their security can be … Continue reading

Posted in Uncategorized | Leave a comment