A grouping of problems in computational complexity theory. These are NP problems that are at least as hard as any other problem in NP. Finding an efficient solution for any NP-complete problem would imply a similar solution was possible for any NP problem. NP-complete problems are the ideal ‘gold standard’ for cryptography, but this is difficult to achieve in practice.
