I want to optimize the way I'm using John the Ripper. I have a password with a know length (9) that consists only of (lower-case) hex characters and exactly two special characters.
First I tried using the
--increment=ASCII option combined with a fixed password length. Then I stripped the character set down to digits, a..f and the known special character set, so JtR skips impossible combinations.
Out of academic interest I'm wondering if there is a more efficient way on how to describe the pattern: that it's all hex values sprinkled with exactly two special characters out of a defined set
Examples of matches:
aa-bb!123 (exactly two special characters)