Are there public key cryptography algorithms that are provably NP-hard to defeat? [closed]

Answer 1

While many forms have been broken, check out Merkle-Hellman, based on a form of the NP-complete 'Knapsack Problem'.