n this section we will do a written response about hard problems. Demonstrating if a problem is hard is a concept far outside the scope of this course. These are topics for complexity research. However, understanding why a problem is considered hard is vital to understanding cryptographic concepts. Demonstrating these challenges are almost complete an exercise in writing equations. In this section you will instead spend time thinking about what we know $($and don$$t know$)$ about hard problems.

In this section you will give a written response to an open question about hard problems.

QUESTION $5\mathrm{.}1$

What hard problem does Diffie$-$Hellman rely on to provide computational security?

Choose one $1$ point

Prime Factorization

Super$-$Polynomial Time

Exponential Security

Discrete Logarithm