Posts: 37
Threads: 21
Joined: Jul 2015
I ran it fine on rockyou.txt, but when I tried it on a wordlist that was several gigs, it seemed to choke. In taskmanager, it is sitting at 0% cpu usage, 0.5 meg of memory, and no disk usage. It has been this way for quite a while.
Is there any advantage to using a very large wordlist over a shorter one? Just curious. What wordlist do you recommend I use?
Thank you.
Posts: 5
Threads: 0
Joined: Jul 2015
I have different wordlists for different things. I have probably over 40 wordlists of varying in size. Generally when it comes to hashcracking I have certain targeted wordlists that I use first. If it is cracking without any knowledge of the hash then I use a large general wordlist. From there you can go to using rules and masks. Everyone has their own preference on how they do things and from what I have seen so far there is no "right way" to do it.
Posts: 37
Threads: 21
Joined: Jul 2015
What would be the best way to approach this problem?
I have a 7z file I password protected some years ago. I used a password with some variation that I can't remember and wrote it down but don't have access to the paper.
I use about three or four "root" words for my passwords, and prepend and append various things to them like so:
(not using the real words)
batman, fromlouie, genius
some of the stuff I add might be like:
fromlouie123, fromlouie123#, fromlouie###, 123fromloiue###, etc.
I also think that, on top of that I might have also added some random characters I never use like "^2x" but I don't know how many or what type.
I don't know if there is any value in using a .hcstat file generated from a random wordlist and applying a markov-threshold of something like 25 to a mask attack to speed it up. I am afraid of letting it run for a long time and missing the winning combination.
Is there any value of creating a dictionary of around 50 or 100 combinations of what I think the password might be and creating a .hcstat from that and adding markov to my attack.
I do know that my current approach will take too long and I'm not sure what to do. I really need to solve this.
Posts: 5
Threads: 0
Joined: Jul 2015
(07-28-2015, 09:43 PM)turbogiant76 Wrote: What would be the best way to approach this problem?
I have a 7z file I password protected some years ago. I used a password with some variation that I can't remember and wrote it down but don't have access to the paper.
I use about three or four "root" words for my passwords, and prepend and append various things to them like so:
(not using the real words)
batman, fromlouie, genius
some of the stuff I add might be like:
fromlouie123, fromlouie123#, fromlouie###, 123fromloiue###, etc.
I also think that, on top of that I might have also added some random characters I never use like "^2x" but I don't know how many or what type.
I don't know if there is any value in using a .hcstat file generated from a random wordlist and applying a markov-threshold of something like 25 to a mask attack to speed it up. I am afraid of letting it run for a long time and missing the winning combination.
Is there any value of creating a dictionary of around 50 or 100 combinations of what I think the password might be and creating a .hcstat from that and adding markov to my attack.
I do know that my current approach will take too long and I'm not sure what to do. I really need to solve this.
I honestly think the easiest solution would be just to put your basewords into a wordlist and then run rules against it and/or a mask attack.
