+- hashcat Forum (https://hashcat.net/forum)
+-- Forum: Support (https://hashcat.net/forum/forum-3.html)
+--- Forum: hashcat (https://hashcat.net/forum/forum-45.html)
+--- Thread: Trying all case permutations for all alphabetical letters of a password? (/thread-12497.html)
Trying all case permutations for all alphabetical letters of a password? - 42 - 02-04-2025
Greetings,
We have a password of 24 characters with mixed upper and lower case characters, numbers and punctuation.
I want to try a mask attack of all possible upper/lower case permutations of each alphabetical character in the password e.g. say the password is:
ThisIsA24CharacterPassw0
Then it should do a mask of all the A..Z an a..z characters and try ever case modulation option on each of them.
Currently mask attacks allow for:
?l = abcdefghijklmnopqrstuvwxyz
?u = ABCDEFGHIJKLMNOPQRSTUVWXYZ
?d = 0123456789
?h = 0123456789abcdef
?H = 0123456789ABCDEF
?s = «space»!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~
?a = ?l?u?d?s
?b = 0x00 - 0xff
So one more like:
?aC
Which would try a and A in that position so both upper and lower case of the letter a in this case the mask input needs to be 3 characters to allow the user to input the initial character that should be tried in all its case varients.
So it would be something like:
?TC?hC?iC?sC?IC?sC?AC24?CC?hC?aC?rC?aC?cC?tC?eC?rC?PC?aC?sC?sC?wC0
I can't see any simple way to do this in Hashcat presently without a complex additional Python script and I find it strange that a "case-toggling" mask is not available?
Let me know your thoughts, if this could be implemented or perhaps there is already a simple way to implement this?
Kindest wishes,
Martin