04-24-2024, 06:57 AM
I've been given a hash to crack as a challenge - the password it was generated from uses some non-standard l33tspeak substitutions that have posed a real challenge to setting up an efficient cracking scheme. The password contains at least two 'i's. One has been replaced with a '!' and the other with a 'l'.
I'm not sure how to handle this scheme with rules. From my understanding, a Hashcat rule can only replace every instance of one character with another character for each rule. So I can replace every 'i' with a '!' or 'l', but not both simultaneously. There also may be standard 'i's in the password as well.
I'm currently piping a top 10,000 wordlist into princeprocessor to generate candidates, before passing them to Hashcat to apply rules. Is there any tool or scheme that might be able to handle this kind of complex substitution?
I'm not sure how to handle this scheme with rules. From my understanding, a Hashcat rule can only replace every instance of one character with another character for each rule. So I can replace every 'i' with a '!' or 'l', but not both simultaneously. There also may be standard 'i's in the password as well.
I'm currently piping a top 10,000 wordlist into princeprocessor to generate candidates, before passing them to Hashcat to apply rules. Is there any tool or scheme that might be able to handle this kind of complex substitution?