Prime Numbers and Cybersecurity

A NP Problem

Prime numbers are whole numbers that can only be divided by themselves or one, and they are used in our every day lives through encryption and cybersecurity.

Multiplying two prime numbers, even if the numbers are very large is “easy” by easy I mean, it can be solved and verified in polynomial time or O(n^k) in complexity theory, which puts this problem in class P. In…