Write an asymmetric cryptographic algorithm that relies on a NP-complete or NP-hard problem. Extra points if it can be used both for encryption AND signing.
>>2
The problem with NP-complete problems is that it's hard to evaluate the 'hardness' of a particular instance of the problem. Take 3SAT for example -- is there any way of determining how hard a particular instance of it is?
jahr im native german speaker and german is so similar to english that u often forget what was english and what was german
Name:
Anonymous2011-07-22 14:52
>>7
But german is a synthetic language! You can mutate words on fly. With english you have to use separate adjectives in most cases. At least english allows writing just "items", instead of "list of item", like Haskell do.