[Cryptography] List of Proven Secure Ciphers / Hashes

[Jerry Leichter]

On Sep 4, 2014, at 9:23 PM, Jonathan Katz <jkatz at cs.umd.edu> wrote:
> Once you allow known-plaintext attacks, symmetric-key crypto is also in NP.
This is a meaningless statement.  NP has an exact, technical definition.  There's nothing to "allow" or "disallow".

Whether "is in NP" or even "is NP complete" is relevant to cryptography is something one can debate - though not very much, as the answer is clear:  No.  (NP is about the hardest problems in some set.  Knowing that there is *some* hard problem is not particularly useful when what you want to know is that *a particular problem* - reading a particular cipher text, for example - is hard.)

But if you're going to talk about a technical matter, you have to use the language as it's understood in the community.
                                                        -- Jerry


-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 4813 bytes
Desc: not available
URL: <http://www.metzdowd.com/pipermail/cryptography/attachments/20140905/c5798ddd/attachment.bin>