Cryptographic assumptions are foundational hypotheses about the hardness of certain mathematical problems, which underpin the security of cryptographic protocols. These assumptions, such as the difficulty of factoring large integers or solving discrete logarithms, are crucial for ensuring that cryptographic systems remain secure against adversaries with bounded computational resources.