2
$\begingroup$

I was actually wondering... How long would it take to crack/brute force a 32 bit key/encryption and a 16 bit key/encryptions respectively on a 4GHZ and a 2GHZ PC. I know that a 32 bit integer has 4,294,967,296 combinations while a 16 bit number has exactly 65,536 combinations but I don't know how long It'll take. and what processor would be able to brute force this in the shortest period of time

$\endgroup$
3
  • $\begingroup$ probably less than a second on any modern system, hell a smart phone could do it in under a second i bet. $\endgroup$ Oct 12, 2020 at 23:35
  • $\begingroup$ @RichieFrame Even an Intel 4004 could "break" a 16-bit integer in the blink of an eye. $\endgroup$
    – forest
    Oct 13, 2020 at 0:42
  • $\begingroup$ @forest I am making the assumption that a key scheduling algorithm needs to be run for each key, in the context of an algorithm that uses 32-bit keys, or a truncated key for AES $\endgroup$ Oct 13, 2020 at 19:54

1 Answer 1

2
$\begingroup$

$4,294,967,296ops/4,000,000,000ops/s=1.07s$

$65,535ops/4,000,000,000ops/s=16.4μs$

2GHz twice that.

That's per-core. So 8 cores = 1/8 of a second or so. 64-core/128 thread 2GHz Threadripper = about 16ms.

A GPU will be even faster. It's recommended to brute force the entire 2^32 space for testing various numerical functions, it's fast and catches all the edge cases you might not have thought about. Brute forcing 2^64 values takes a month or so on a fast GPU, easily doable faster on a GPU cluster.

Edit, thanks to kelalaka: a Tesla V100 can run about $2^{47}$ SHA-1 hashes/hour. SO $720hours/month\times2^{47}Hashes/hour\approx2^{56}Hash/month$. That's about 182 months total, but each hash is substantially more work than just incrementing an integer, so a faster operation can likely be brute-forced in a month on such a GPU. Slower operations need a cluster, but such clusters can be rented from various cloud providers.

$\endgroup$
9
  • 1
    $\begingroup$ Actually, for an integer that small, a GPU will be significantly slower. $\endgroup$
    – forest
    Oct 13, 2020 at 0:41
  • 1
    $\begingroup$ Do you have a reference for a (single) GPU that could make $2^{64}$ operations in a month? That seems a lot. And what kind of operation? For brute force to be a method worth any consideration, that operation must use several instructions; I can't imagine anything below 4 arithmetic instructions. $\endgroup$
    – fgrieu
    Oct 13, 2020 at 7:01
  • 2
    $\begingroup$ Tesla V-100 working on SHA-1 does $2^{35}\,\text{Hash/second}\approx2^{47}\,\text{Hash/hour}$ [note: the present comment was edited by a moderator per the author's request; it was also removed a later comment based on the earlier, incorrect version] $\endgroup$
    – kelalaka
    Oct 13, 2020 at 19:25
  • $\begingroup$ Per my number crunching based on a Tesla-V100 doing a reported $56\,\text G\,\text H/\text s$ on an MD5 workload, I get $2^{57}$ per month, which is reasonably in line with $2^{64}$ much simpler but still meaningful crypto operations per month. I had not realized that we reached this landmark. $\endgroup$
    – fgrieu
    Oct 15, 2020 at 15:48
  • 1
    $\begingroup$ Also, see qberty.com/nvidia-rtx-3090-hashcat-benchmark and qberty.com/nvidia-rtx-3090-hashcat-benchmark I would not update my answer, however, you can benefit from them. $\endgroup$
    – kelalaka
    Oct 15, 2020 at 19:25

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.