10-26-2018, 03:30 PM
Hello Guys,
I write a thesis to review the security in windows systems starting with LM-Hash.
For showing the weakness of the LM-Algorithm I create a 14 char random password without numbers.
The first part i successfully obtained with help of rainbow tables and now i want to obtain the second part.
The netntlm.pl script which uses John is much too slow for it. It runs 8 hours until I canceled it.
So i created a file with all upper/lower case possibilites first (with echo{a,A}..etc)
The benchmark says that i have the power to calculate 11873 MH/s (AMD R9 390)
My calculation is that hashcat should be able to crack the remaining 7 chars in under an hour:
85(- 10 numbers)^7 / 11873000000 H/s = time in second
85^7/11873000000= 2700 s
passwordpossibilites.txt= All Lower/Uppercase possibilites of M%RFOFT
But when i start the hybrid attack
hashcat64.exe -m 5500 hash.txt -a 6 passwordpossibilites.txt ?a?a?a?a?a?a?a
the status said that it tooks 26 years.
I then tried the example hash for netlmv1 from wiki. Pure bruteforcing is done in seconds and when i try a hybrid attack it tooks 189 days.
test.txt simple contains an 'h' (first capitol of 'hashcat')
hashcat64.exe -m 5500 hash.txt -a 6 test.txt ?a?a?a?a?a?a
What did i'm wrong im confused. I also tried to create "more work" which the program suggests :
hashcat64.exe -a 6 test.txt ?a?a?a?a?a?a | hashcat64.exe -m 5500 hash.txt
but then the estimated time is always 0 sec.
I hope someone can help me here
Greetings
Marsupilami
I write a thesis to review the security in windows systems starting with LM-Hash.
For showing the weakness of the LM-Algorithm I create a 14 char random password without numbers.
The first part i successfully obtained with help of rainbow tables and now i want to obtain the second part.
The netntlm.pl script which uses John is much too slow for it. It runs 8 hours until I canceled it.
So i created a file with all upper/lower case possibilites first (with echo{a,A}..etc)
The benchmark says that i have the power to calculate 11873 MH/s (AMD R9 390)
My calculation is that hashcat should be able to crack the remaining 7 chars in under an hour:
85(- 10 numbers)^7 / 11873000000 H/s = time in second
85^7/11873000000= 2700 s
passwordpossibilites.txt= All Lower/Uppercase possibilites of M%RFOFT
But when i start the hybrid attack
hashcat64.exe -m 5500 hash.txt -a 6 passwordpossibilites.txt ?a?a?a?a?a?a?a
the status said that it tooks 26 years.
I then tried the example hash for netlmv1 from wiki. Pure bruteforcing is done in seconds and when i try a hybrid attack it tooks 189 days.
test.txt simple contains an 'h' (first capitol of 'hashcat')
hashcat64.exe -m 5500 hash.txt -a 6 test.txt ?a?a?a?a?a?a
What did i'm wrong im confused. I also tried to create "more work" which the program suggests :
hashcat64.exe -a 6 test.txt ?a?a?a?a?a?a | hashcat64.exe -m 5500 hash.txt
but then the estimated time is always 0 sec.
I hope someone can help me here
Greetings
Marsupilami