Nondeterministic Polynomial time: a grouping of problems in computational complexity theory. This is the class of problems where if you give me a solution, I can check it efficiently on a conventional computer. This property is useful in conventional maths-based cryptography.
