Proving that cryptographic problems are truly hard is related to solving the famous P versus NP problem in computer science