Pages:
Author

Topic: Found old paper with password hints... btcrecover help w/ python errors (Read 566 times)

legendary
Activity: 2268
Merit: 18711
For some reason stacking ^1^'s and ^2^'s on top of eachother with 30 total lines took 12 hours to guess 100,000 passwords. The other format I was doing took 10 seconds. Weird. I wonder what is going on here.
So, in a few local tests it seems the putting all the same numbers on the same line does make things run a little faster for me when compared to listing them all on their own line, but the difference is ~10%, and nowhere near the discrepancy you have seen.

Still, as I said above, if you are putting a positional anchor on every entry, then whether or not all the same positions are on the same line or on their own line is irrelevant to the passwords it will generate. There is no reason to run the one which is so slow when the other option will generate the same list in a fraction of the time.
newbie
Activity: 23
Merit: 12
There’s very similar case, where they specify tokens for the end and beginning (and even for the middle)
I guess it would be:
Code:
^1^abc
^1^cde
^2^987
^2^654
Etc.
Are you sure this format wont do something funky though? It's not even starting to count or crack after a while.
Provided you have a positional anchor (^x^) before every entry, then it will make no difference if you put every entry on its own line or you group all the entries in the same position together on the same line.

I have just created a test file which looks like this:

Code:
^1^1
^1^One
^2^2
^2^Two
^3^3
^3^Three
^4^4
^4^Four

And run with the argument --min-tokens 4 and it spat out the exact 16 combinations I would expect it to. Similarly, I changed it to this:

Code:
^1^1 ^1^One
^2^2 ^2^Two
^3^3 ^3^Three
^4^4 ^4^Four

And it spat out the exact same 16 combinations. If your tokens file is not working there must be something else wrong with it.

For some reason stacking ^1^'s and ^2^'s on top of eachother with 30 total lines took 12 hours to guess 100,000 passwords. The other format I was doing took 10 seconds. Weird. I wonder what is going on here.
legendary
Activity: 2268
Merit: 18711
There’s very similar case, where they specify tokens for the end and beginning (and even for the middle)
I guess it would be:
Code:
^1^abc
^1^cde
^2^987
^2^654
Etc.
Are you sure this format wont do something funky though? It's not even starting to count or crack after a while.
Provided you have a positional anchor (^x^) before every entry, then it will make no difference if you put every entry on its own line or you group all the entries in the same position together on the same line.

I have just created a test file which looks like this:

Code:
^1^1
^1^One
^2^2
^2^Two
^3^3
^3^Three
^4^4
^4^Four

And run with the argument --min-tokens 4 and it spat out the exact 16 combinations I would expect it to. Similarly, I changed it to this:

Code:
^1^1 ^1^One
^2^2 ^2^Two
^3^3 ^3^Three
^4^4 ^4^Four

And it spat out the exact same 16 combinations. If your tokens file is not working there must be something else wrong with it.
newbie
Activity: 23
Merit: 12
How does --global-ws and --local-ws work?

You need to learn a bit about OpenCL to understand how those works. One thing i know, it's related with how much btcrecover use GPU VRAM (which also affect brute force speed).

I heard some people use that with larger lists... Wondering if I'll need that. One of my old larger lists was like more than 100 million I think and it almost started taking up 20gb ram after 4 hours so I'm guessing global and local commands prevent that much usage? I can afford to give it 20gb ram but I'm afraid it would have kept climbing at only 4 hrs before I quit the run.

I don't remember about RAM usage, but --global-ws and --local-ws is strongly recommended to improve brute force speed for large list password/token. You'll need to test best number for your device though.

For some reason my most recent word list took forever to launch. It got stuck after the

Code:
* * * * * * * * * * * * * * * * * * * *
*          Security: Warning                *
* * * * * * * * * * * * * * * * * * * *

Wallet Type: btcrpass.WalletBitcoinCore
Wallet difficulty: 40,829 SHA-512 iterations

part. Before it even says "counting passwords" I come back hours later to find it only guessed 24,000 passwords out of 93,000 possibilities. I was zipping through 100k lists in 10 seconds before. I will restart my machine maybe..

Also, for the global and local commands. Do I need to associated numbers with each of those commands? I don't recall reading anything that could actually explain what the numbers were, just that you need to adjust them in tandem.
newbie
Activity: 23
Merit: 12
Please see that documentation page, especially part about anchors:
https://btcrecover.readthedocs.io/en/latest/tokenlist_file/

There’s very similar case, where they specify tokens for the end and beginning (and even for the middle)
I guess it would be:
Code:
^1^abc
^1^cde
^2^987
^2^654
Etc.

Ok I'll try this, I had my token list setup where all ^1^'s were on the same line and only had 3 lines but 40 guesses on each line..

edit: I now have 29 lines total ^1^ through ^10^ with 2-5 possibilities for each ^1-10^ notation.

Are you sure this format wont do something funky though? It's not even starting to count or crack after a while. Usually it starts counting right away. Maybe it counts # of password variations with cpu before cracking with gpu? Because listpass does not use gpu, list pass is not counting passwords either - also stuck right before stuff starts to load. The number must be really big, it is taking about 20% cpu right now.

How does --global-ws and --local-ws work? I heard some people use that with larger lists... Wondering if I'll need that. One of my old larger lists was like more than 100 million I think and it almost started taking up 20gb ram after 4 hours so I'm guessing global and local commands prevent that much usage? I can afford to give it 20gb ram but I'm afraid it would have kept climbing at only 4 hrs before I quit the run.
legendary
Activity: 952
Merit: 1385
Please see that documentation page, especially part about anchors:
https://btcrecover.readthedocs.io/en/latest/tokenlist_file/

There’s very similar case, where they specify tokens for the end and beginning (and even for the middle)
I guess it would be:
Code:
^1^abc
^1^cde
^2^987
^2^654
Etc.
newbie
Activity: 23
Merit: 12
Ok I'm running into some issues.. I guess I didn't really understand how the syntax worked, but i'm running some password lists and double checking if certain combos are being spit out but theyre not..

So I've gone ahead and broke it down into the 3 basic parts of the password.

If I have 40 guesses for each third of the password, then how would I write it to test all 40 combinations in each slot against the previous?

example

Password part 1 line 1: possibilities = 123 or 4567 or 8910
Password part 2 line 2: possibilities = 123 or 4567 or 8910
Password part 3 line 3: possibilities = 123 or 4567 or 8910

I want to test every possible combination available on each line

So.. ex.
123 123 123
123 123 4567
123 4567 4567
123 4567 123

But in all reality I have 40 total 3-4 character sequence combinations for each "line" of the password.
newbie
Activity: 23
Merit: 12
I do have a moderate GPU but I'm not sure if it's using it correctly. The guesses haven't seemed to slow down, but now in task manager it is not reporting any usage on the GPU while attempting to crack. I'm pretty sure when I first started it stated around 80% usage on the GPU.

I don't know how accurate is task manager to monitor GPU usage, but it might be because known CPU bottleneck on btcrecover[1-3]. Have you tried different software such as GPU-Z[4] to monitor GPU usage?

[1] https://btcrecover.readthedocs.io/en/latest/GPU_Acceleration/#performance-tuning-background
[2] https://github.com/3rdIteration/btcrecover/issues/184
[3] https://github.com/3rdIteration/btcrecover/issues/119
[4] https://www.techpowerup.com/download/techpowerup-gpu-z/

I actually tried hardware monitor and it's actually reporting a higher percentage and higher temp. I cranked up the fans. I've done 2 or three new password lists and still nothing but I have some more to generate.

I was running one list for 4 hrs at 10k/Ps but it started to eat up like 20gb of ram lol.

I've seen some people using the --global-ws and --local-ws commands when they have larger lists. I'm guessing this helps allocate resources? Can anyone describe how these two commands work and the numbers associated with them? Thanks again everyone.
newbie
Activity: 23
Merit: 12
Do you mean something like that?

Code:
^1^%[ABC...Zabc....z]
^2^%[ABC...Zabc....z]
^3^%[ABC...Zabc....z]
^4^%[0123456789]
^5^%[:!@#;]
^6^%[0123456789]
^7^%[0123456789]
^8^%[ABC...Zabc....z]
^9^%[ABC...Zabc....z]
^10^%[ABC...Zabc....z]

depends what are you "special characters"
And you should fill correctly "a..z" part

I'm gonna try this in combination with the  --min-tokens 10 command o_e_l_e_o suggested

EDIT: It now looks like it's doing what I was intending! Now I'm still not sure if GPU is being utilized. I think i'm going to brake it down a lot simpler using this method to reduce password list size. I use enablegpu command but task manager shows 0% usage on GPU now.. But it doesn't seemed like it has slowed down.
legendary
Activity: 952
Merit: 1385
Do you mean something like that?

Code:
^1^%[ABC...Zabc....z]
^2^%[ABC...Zabc....z]
^3^%[ABC...Zabc....z]
^4^%[0123456789]
^5^%[:!@#;]
^6^%[0123456789]
^7^%[0123456789]
^8^%[ABC...Zabc....z]
^9^%[ABC...Zabc....z]
^10^%[ABC...Zabc....z]

depends what are you "special characters"
And you should fill correctly "a..z" part
newbie
Activity: 23
Merit: 12
password format is

xxx1:23xxx

and if there's 20 different characters that could represent xxx, and 50 characters that could represent 1:23, and 20 different characters that could represent the last part, xxx I want to be able to guess 20 characters for each x x x and then 20 possible characters in each middle position of 1:32, and 20 characters for the each of the characters in the last x x x

hopefully this makes a little more sense.. I'm thinking this is going to generate a lot of guesses.. But I am willing to wait.

I do have a moderate GPU but I'm not sure if it's using it correctly. The guesses haven't seemed to slow down, but now in task manager it is not reporting any usage on the GPU while attempting to crack. I'm pretty sure when I first started it stated around 80% usage on the GPU.
legendary
Activity: 2268
Merit: 18711
Not really following you. Can you share your tokens file? PM me if you would prefer (and I can provide a PGP key for encryption if you would prefer).
newbie
Activity: 23
Merit: 12
Ahh, my bad. Yeah, when you have a list of tokens like this, it will try all possible ways of combining them, including selecting no tokens from a given line. First of all, make sure that you have ^1^ up to ^10^ in front of every token. Then, add --min-tokens 10 to your command in the terminal.

Okay now it's guessing ABCXXXXXX

I want it to guess all characters in the first three spaces, combined with all possible characters in the 2nd space, and all possible characters in the 3rd or last part of the password. Brake it down into 3 sections, hopefully this makes sense?

Thanks again for all the help. I really do appreciate it.
legendary
Activity: 2268
Merit: 18711
Ahh, my bad. Yeah, when you have a list of tokens like this, it will try all possible ways of combining them, including selecting no tokens from a given line. First of all, make sure that you have ^1^ up to ^10^ in front of every token. Then, add --min-tokens 10 to your command in the terminal.
newbie
Activity: 23
Merit: 12
I'm actually a little confused at this point. I've ran a few variations of the commands you've given me and it seems to be starting with 3 characters and testing that out to 10 characters.

I want it to test only 10 character possibilities, but with every character involved in the 1st position, 2nd and 3rd(last 1/3) last part of the 10 digit character sequence.

Any ideas?
newbie
Activity: 23
Merit: 12
Would there be a way to input single characters?
Absolutely. Just add more lines with the same ^1^ at the start of each entry, changing the 1 to the number of the character position in the password. I would also use the argument %[chars] rather than list every character as its own entry, as it will be much easier for you to write and edit. So for example, if you think the first character might be A, B, C, a, b, or c, then rather than writing this:

Code:
^1^A ^1^B ^1^C ^1^a ^1^b ^1^c

You would just write this:

Code:
^1^%[ABCabc]

Thank you Mr. Wizard
legendary
Activity: 2268
Merit: 18711
Would there be a way to input single characters?
Absolutely. Just add more lines with the same ^1^ at the start of each entry, changing the 1 to the number of the character position in the password. I would also use the argument %[chars] rather than list every character as its own entry, as it will be much easier for you to write and edit. So for example, if you think the first character might be A, B, C, a, b, or c, then rather than writing this:

Code:
^1^A ^1^B ^1^C ^1^a ^1^b ^1^c

You would just write this:

Code:
^1^%[ABCabc]
newbie
Activity: 23
Merit: 12
Dang so i'm up to about a million guesses. No go yet

I have about 90 words on each line. I duplicated 1, 2 and 3 into the first line, 2nd line and 3rd line so my guesses have tripled. Still no go. I really thought I was going to get it.

I'll keep refining the list and thinking of more possibilities.

Would there be a way to input single characters? like break it down even more? for example first line ^1^ would have every character/letter/number/symbol I think is possible in the password. that would be three characters long, the first part of the password. Then do the same thing for the middle 4 characters, and then again for the last 3 characters. Would this be a huge password list? I don't mind letting it run, it took about 1 or 2 min for 1 million guesses.

Also, it says its using GPU but now I'm not seeing my GPU get maxed out. I'm pretty sure the first time I was doing it I was seeing GPU take up a lot more resources like 80 or 100% usage in task manager.
legendary
Activity: 952
Merit: 1385
Well I somewhat understand how to configure tokenlist and am cracking at about 10,000 checks per second now on the GPU so I'm not sure why I'd need to switch to hashcat. I think I just need to refine my tokenlist now.


Ah, ok, good luck then!
I think you have many hints, so your chances are really big!
newbie
Activity: 23
Merit: 12
If the problem is to find wallet.dat password, I think hashcat is a much better solution.
I think it is easier to configure search parameters (at least for me)...
https://hashcat.net/hashcat/

You would simply prepare a configuration using masks:
https://hashcat.net/wiki/doku.php?id=mask_attack





Well I somewhat understand how to configure tokenlist and am cracking at about 10,000 checks per second now on the GPU so I'm not sure why I'd need to switch to hashcat. I think I just need to refine my tokenlist now.
Pages:
Jump to: