Well if someone makes a complete database. would be good. Wish i could run 4 cards and afford them. Mind u database would be so big !!.
Be good to crack the algorithm, but aint going to be easy.
Hey Scamentology,
Just out of interest, I note you are not using the -u switch to supress the info
on wordlist size and line(word) count.
In my tests it has not negatively affected the results (not using the -u switch that is),
however interested to hear whether you have experienced the same on a continuous basis ?
Last edited by TAPE; 06-16-2011 at 04:41 PM.
Well if someone makes a complete database. would be good. Wish i could run 4 cards and afford them. Mind u database would be so big !!.
Be good to crack the algorithm, but aint going to be easy.
I have had no issues without the -u switch. I usually never do more than 2 billion guesses though. just stick to the zip codes of the area - my typical command is below
and caught a couple this wayCode:./crunch 10 10 -t 213%%%%%%% | pyrit -e ssid -r ssid.cap -o /root/pass.lst -i - attack_passthrough
I assumed pyrit just hashed the wordcount outputCode:./crunch 12 12 -t 650-%%%-%%%% | pyrit -e ssid -r ssid.cap -o /root/pass.lst -i - attack_passthrough
"Never do anything against conscience -- even if the state demands it."
-- Albert Einstein
Just wondering if anyone got anywhere with this?
Seems there's still no BTHomeHub2 algorythm publically available, and have been doing some figures on brute forcing the default key... A trillion possible combinations (1610) at 13,000 keys/s would to take (me) 2.5 years, and even removing all keys that contain repeating/incrementing sequences (eg 7777a1b2c3 or a1b12342c3) saves a valiant 3.6 billion combinations, but that only equates to about 0.36% (3.5 days).
No one had any other ideas/come across anything useful? Given the inherent tenacity of a pentester, I can't believe this isn't driving anyone else nuts!![]()