Computational infeasibility refers to problems that require an impractical amount of time or resources to solve with current technology, often due to their exponential growth in complexity as the problem size increases. This concept is crucial in cryptography, where security relies on the assumption that certain mathematical problems cannot be efficiently solved by adversaries.