3 ms·
But that's not the range in question, this one has 66 bits. You're describing a meet in the middle attack but the runtime would be too high
by the_clarence 2y ago
But that's not the range in question, this one has 66 bits. You're describing a meet in the middle attack but the runtime would be too high
- nullc 2y agoMy example is specifically for a 66-bit range. There are two loops in my post, one removes 2^33 multiples of 2^33, the other builds a table to check for values with a 33-bit range. My example will find a solution in a 66-bit range using only 2^34 point operations and 2^33 table lookups. Work thought it, I think it'll be more informative than me simply repeating myself further. If you're still confused, ask specific questions and I'll be glad to answer.
- the_clarence 2y agoOh right nevermind. For about 300GB of data. I would assume this is what they did them