I am trying to figure out this question:
Generalize the Merkle-Damgard construction for any compression function that compresses by at least one bit . You should refer to a general input length £' and general output length E (with £' > E).
It is in my understanding that the Merkle-Damgard takes an input of 2*l(n) and compresses it to l(n). How would I go about breaking up the input so that an arbitrary hash length L' can be outputted?