01-27-2014, 07:20 PM
Keep cool, there's no magic involved.
What this program is using is a technique called bitslice. DES based algorithms like LM can be improved alot by using bitslice compared to "traditional" techniques.
The original bitslice DES/LM source was posted on reddit a while back and at this time it was doing around 3000M c/s. I was able to improve it to around 6400M c/s which is actually faster than Hash Suite 3.0, you can read about here: http://www.reddit.com/r/crypto/comments/...e/#c7sm2c3
Again, this technique works only for LM hashes, but for LM hashes you should use rainbow tables. If you really need to brute-force the entire 95^7 keyspace you can do that in less than a day on 1400M c/s since the algorithm is so designed that the keyspace is so small.
What this program is using is a technique called bitslice. DES based algorithms like LM can be improved alot by using bitslice compared to "traditional" techniques.
The original bitslice DES/LM source was posted on reddit a while back and at this time it was doing around 3000M c/s. I was able to improve it to around 6400M c/s which is actually faster than Hash Suite 3.0, you can read about here: http://www.reddit.com/r/crypto/comments/...e/#c7sm2c3
Again, this technique works only for LM hashes, but for LM hashes you should use rainbow tables. If you really need to brute-force the entire 95^7 keyspace you can do that in less than a day on 1400M c/s since the algorithm is so designed that the keyspace is so small.