Why cryptography is not based on NP-complete problems

Cryptography is not based on NP-complete problems - let me explain why. Hard problems in cryptography Cryptographic schemes are based on the computational difficulty of solving some &lsquo;hard&rsquo; problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this: The RSA Problem I generate two large, random prime numbers, p p p and q q q , each of length 1024…