[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <5f4239740904230945v757c5b42p7d48c9119011b5fa@mail.gmail.com>
Date: Thu, 23 Apr 2009 11:45:52 -0500
From: Minga Minga <mingakore@...il.com>
To: john-users@...ts.openwall.com
Subject: Problem with [List.Rules:NT]
Since I posted some rules, I get to post a problem I am having too ;)
--------------
I have this in my john.conf file. ( I didn't write it - and I don't
even understand it).
[List.Rules:NT]
l
lMT[*0]T[*1]T[*2]T[*3]T[*4]T[*5]T[*6]T[*7]T[*8]T[*9]T[*A]T[*B]T[*C]T[*D]Q
--------------
I have this test wordlist file:
# more a.dic
aaa
bbbb
------------
I run this command:
./john -w:a.dic --rules:nt -stdout | wc
And get the following output:
28675 28675 129038
So - 28675 possible combinations. The problem is this:
/john -w:a.dic --rules:nt -stdout | sort -u | wc
24 24 112
There are only 24 REAL combinations. So the --rules:nt wastes a lot of effort.
Its not THAT big of a deal - but does waste a lot of CPU time on some large
wordlists.
Is there a better way/rule to get all the possible capitalization combinations
for a word list?
---------------
The output from the above command is:
aaa
aaA
aAa
aAA
Aaa
AaA
AAa
AAA
bbbb
bbbB
bbBb
bbBB
bBbb
bBbB
bBBb
bBBB
Bbbb
BbbB
BbBb
BbBB
BBbb
BBbB
BBBb
BBBB
-Minga
--
To unsubscribe, e-mail john-users-unsubscribe@...ts.openwall.com and reply
to the automated confirmation request that will be sent to you.
Powered by blists - more mailing lists
Confused about mailing lists and their use?
Read about mailing lists on Wikipedia
and check out these
guidelines on proper formatting of your messages.
