Mask attack for unique characters?
#1
Hello

I want to crack by a rule which only uses alphabetic characters with no duplicates allowed. So for example ABCDEFGH wouldbe allowed but AABCDEFG not because of the double A
So if i would look for a 9 char password it would be 26*25*24*23*22*21*20*19*18 possible combinations.

Is there a mask rule i can use for this? or i need to make a 'wordlist' ?
#2
the best solution would probably be to write a script that outputs exactly what you want, and feed it to hashcat via stdin.
#3
You're lucky I've recently added that feature to maskprocessor v0.69. You can control the number of concurrent chars with the -q parameter. You can get it here: http://hashcat.net/wiki/doku.php?id=maskprocessor

Take a look here for comparison:

Code:
root@sf:~/maskprocessor-0.70# ./mp64.bin ?u?u?u?u?u?u?u?u?u | head -10
AAAAAAAAA
AAAAAAAAB
AAAAAAAAC
AAAAAAAAD
AAAAAAAAE
AAAAAAAAF
AAAAAAAAG
AAAAAAAAH
AAAAAAAAI
AAAAAAAAJ

Code:
root@sf:~/maskprocessor-0.70# ./mp64.bin ?u?u?u?u?u?u?u?u?u -q 2 | head -10
ABABABABA
ABABABABC
ABABABABD
ABABABABE
ABABABABF
ABABABABG
ABABABABH
ABABABABI
ABABABABJ
ABABABABK
#4
Thanks alot for that atom, great feature.