In the context an of hash functions we have three required properties.
- Preimage resistance
- Second preimage resistance
- Collision resistance.
The bounds for Pre image collision is $O(2^{n-1})$, the bounds for collision resistance is $2^{n/2}$, what are the bounds for breaking second preimage resistance?