Why are "difficult" mathematical problems crucial for the security of public$-$key cryptography? Discuss the role these problems play in ensuring the security of cryptographic systems and provide examples of such problems used in current cryptographic algorithms.