Perhaps this has been answered before. Grover's algorithm should result in a 256 bit hash being complexity 128 bits to crack.
I was wondering, what if you had a 512 bit hash , and xor'd the lower 256 with the upper 256 bits to result in a final 256 bit hash number.
Does this increase the complexity (ie: decreasing the viability of Grover's algorithm) by any factor?
I'm expecting not, however was just theorizing how you could remap a 512 bit hash into a 256 bit space to stop grovers from functioning (reminiscent of some public key compression algorithms).