02-07-2023, 09:41 PM
Hi community,
I know this feels like not new but with my diffrent research I am really confused and do not know how I should proceed to to make the process to take ages...
So I have 4-handskae messages from a WAP2 session now I want to find the password that I know random of exactly 20 digits. Of course 10^20 would take ages to naive brute-force it.
I have read the latest method available today is the hash 22000 that replace the other methods explained everywhere. Using the mask of 20 digits is not accepted (Integer overflow detected in keyspace of mask) and I understand why.
Do I have a way to cut down the list with with possible passwords/rules or anything that could help from the capture to reduce the computational need? Otherwise I guess my best option is to throw it away and move on 😅
Thanks in advance for your time and help.
I know this feels like not new but with my diffrent research I am really confused and do not know how I should proceed to to make the process to take ages...
So I have 4-handskae messages from a WAP2 session now I want to find the password that I know random of exactly 20 digits. Of course 10^20 would take ages to naive brute-force it.
I have read the latest method available today is the hash 22000 that replace the other methods explained everywhere. Using the mask of 20 digits is not accepted (Integer overflow detected in keyspace of mask) and I understand why.
Do I have a way to cut down the list with with possible passwords/rules or anything that could help from the capture to reduce the computational need? Otherwise I guess my best option is to throw it away and move on 😅
Thanks in advance for your time and help.