Sign up ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.

I want to use john (I hope it's possible) to create all possible combinations of the set A,B,C,D..,Z with fixed 8 length, and distinct letters!





I've tried it with some backtracking algorithms, but they didn't gave me the right results.

Do you guys have any ideas ?

share|improve this question
wolfram alpha may be able to help you find all 1-26 length strings that are permutations of the latin alphabet.… – Frank Thomas Nov 25 '13 at 15:14
Including upper/lower case variations, that's about 5 times 10^13 permutations. Even if you could try 10^6 passwords per second, that would mean some 2 years of efforts. So it is not practical. Is it theoretically challenging? No way: 8 nested loops will do the trick in any programming language. So the point is learning john the ripper's grammar. There are more economical ways. – MariusMatutiae Nov 25 '13 at 16:15

1 Answer 1

For generating dictionaries I use crunch or maskprocessor or statsprocessor from hashcat's utilities and then feed the results into john --pipe

share|improve this answer
I also used crunch, but with crunch, if I want all letters to be different in each password, it ignores the min length and max. It will create passwords with length 26 – user1812076 Nov 25 '13 at 15:21
Then use maskprocessor with ?u?u?u?u?u?u?u?u – Marcin Nov 25 '13 at 15:56

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.