12-11-2022, 04:53 AM
Hello!
I searched a lot but I did not find a solution to my problem, maybe I did not use the right term, I ask my question here hoping that it is not a duplicate
What is the best approach to crack a password between 10 and 15 characters, I know 1 word of 7 letters (jupiter) and 1 symbol (#) but I don't know their position (can be prefix, suffix or in the middle, word before the symbol or inverse), I have to bruteforce the missing characters with possible letter/number/symbol.
ex (* = bruteforced char):
jupiter*****#
#*****jupiter
***jupiter#**
**jupiter**#*
**#**jupiter*
#***jupiter**
... and so on
is there a way to try all possible position of known elements while bruteforcing the missing chars without specificly generating a wordlist?
and if i need to create a wordlist, this can be done with maskprocessor in a oneshot or i need to create every mask manually and append result to the wordlist?
thank you in advance for your answer
I searched a lot but I did not find a solution to my problem, maybe I did not use the right term, I ask my question here hoping that it is not a duplicate
What is the best approach to crack a password between 10 and 15 characters, I know 1 word of 7 letters (jupiter) and 1 symbol (#) but I don't know their position (can be prefix, suffix or in the middle, word before the symbol or inverse), I have to bruteforce the missing characters with possible letter/number/symbol.
ex (* = bruteforced char):
jupiter*****#
#*****jupiter
***jupiter#**
**jupiter**#*
**#**jupiter*
#***jupiter**
... and so on
is there a way to try all possible position of known elements while bruteforcing the missing chars without specificly generating a wordlist?
and if i need to create a wordlist, this can be done with maskprocessor in a oneshot or i need to create every mask manually and append result to the wordlist?
thank you in advance for your answer