512 bit X has been hashed using SHA256(X) = Y
Given Y and half of X (the first 256bits) to attacker, how hard is to reveal whole X
Can SHA256 or any real world function be cracked to allow this problem to be solved faster
Is this problem known in cryptography? and under what name? Tried google for concatenated preimage attack but found nothing.