1
2
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!
Meaning:
ABCFGRTH
QPFLDMRB
etc...
I've tried it with some backtracking algorithms, but they didn't gave me the right results.
Do you guys have any ideas ?
wolfram alpha may be able to help you find all 1-26 length strings that are permutations of the latin alphabet. http://blog.wolframalpha.com/2011/11/29/working-with-permutations-in-wolframalpha/
– Frank Thomas – 2013-11-25T15:14:08.060Including 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 – 2013-11-25T16:15:36.840