Open sibero80 opened 5 years ago
Can you elaborate how to automate this approach? From what I understand, nonce collection is pretty fast compared to cracking a limited number of nonces so, yes, you could start cracking as soon as you've e.g. a complexity of O(2^43) and continue collecting nonces meanwhile but then, what do you do once you've O(2^37) a few minutes later? Drop all current computations and start over? I'm looking for scenarios where it's on average substantially faster to do something else than waiting O(2^37) then running the CPU-intensive part. BTW the Proxmark implementation is apparently today faster and a better way to improve speed would be probably to lift it off and reuse it with libnfc.
Sure thing:
Mi pn532_uart collects around 15-20 nonces/sec, and once the complexity is around O(2^37) it takes at least 10-15 minutes to try cracking a key. If complexity is lower it can even take around 5 minutes. (I'm on a VM machine running over a i7-3230qm. Not the fastest, nor the slowest.)
So the automation would go something like this:
Sometimes, I got distracted and the second crypto1_bs instance began cracking, and by some reason, the second instance finished cracking faster than the first crypto1_bs instance that was running.
I hope I provided enough clarity.
Thank you!
Hello everyone. I'm by no means a programmer, but I think I've discovered a way to improve miLazyCracker's speed.
I've been doing this manually (Running crypto1_bs instances in parallel) with great results.
Too crazy?