Re: Proof of Concept
Interesting question. Has anyone demonstrated a nondeterministic algorithm for finding 2-SHA-256 preimages that outperforms brute force? And does it have reasonable characteristics (eg in space requirements)? I haven't heard of one.
Grover's algorithm doesn't look directly applicable to me - I think the necessary precalculation would take as long as brute force. Basically it's equivalent to creating a rainbow table. But I could be wrong; I haven't given it any real thought.
Biting the hand that feeds IT
