Pseudo preimage for a hash made from a cipher
This problem reduces to a standard preimage attack: if the solution can be found faster than with  $2^l$ trials, then a full preimage can be found faster than $2^n$. The latter problem is considered difficult for iterated hash functions based on the Miyaguchi-Preneel construction, as the latter is difficult even when the IV is not fixed.