Computationally hard reflection

• 1) Describe what it means for a problem to be “computationally hard.”

A problem is computationally hard if a computer cannot solve it within a reasonable time

• 2) What strategies do people use to solve large computationally hard problems?

One strategy is to brute force the problem, testing every possible solution until it finds the best one.

• 3) Why are computationally hard problems important in encryption strategies?

Computationally hard problems are important because you don't want your encryption to be easily cracked. If it is computationally hard, the computer cannot decrypt it in a reasonable amount of time, making it safe.