Re:BitTorrent v2 (2020)
by guimplen on Monday January 10, 2022 @10:09AM
(#29875966)
AFAIK, this is more of a belief than a fact. I would be very curious if you would show me a rigorous proof that e.g. SHA256 requires like on the order of 2^256 of operations to find a preimage of a random 256-bit string.
[ Parent
| on HN ]
Re:BitTorrent v2 (2020)
by Dylan16807 on Monday January 10, 2022 @02:05PM
(#29879931)
If you have something more clever than 2^256 operations, then that's not brute force.