For example, multiplying two numbers together is a P problem: the solution can be found in polynomial time. Another P problem is searching for a book that’s lost in your house.

The strength of an RSA encryption relates to the length of the integer — which defines how big the problem is. For example, a 50-bit integer has 9.67 x 10^16 possible values.