Cryptography is not based on NP-complete problems - let me explain why. Cryptographic schemes are based on the computational difficulty of solving some ‘hard’ problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this: The RSA ProblemI generate two large, random prime numbers, pp and qq, each of length 1024 bits. I then give you the product n=p⋅qn = p \cdot q. Find pp. The RSA cryptosystem cannot be secure unless this problem is hard1. When a cryptograph...