



|


This program uses 2 kind of access method : HEAD or GET method. They are
used by HTTP protocol. Normally, you don't have to change the access method
(default=HEAD). It's only here for performance. If you see that with HEAD method, your
search seems to be a little slow, change the method to 'GET'.


This mode will parse your 2 wordlists line by line : 1 combinaison of
Username / Password per line. For example, if you have 50 Usernames & 50 Passwords,
then, the program will test 50 combinaisons. That its all about
Sometimes, when your wordlists dont have the same quantity
of lines, the number of combinaisons, to be tested, wont be the same. For example,
if you have 45 Usernames & 62 Passwords, then, the program will test the first 45
lines of both wordlists. So, the residual 17 passwords wont be treated.
Other example : 62 Usernames & 45 Passwords, 45 lines to be tested ; 17
residual Usernames will be left apart.

You can set this mode by unchecking the Use
simple search method (see above). This mode is more complete
than the simple search method. It will test all possible combinaisons given for a range of
Usernames & Passwords. For example, if we have 50 Usernames & 50 Passwords in both
wordlists, then, the possible combinaisons will be 50 x 50 = 2500 possibilities.
Otherwise, the simple search method will test only 50 possibilities. As you see, Iterative
mode checks for more combinaisons. Its due to the fact that each Username is tested
with the whole list of Passwords.
We recommand you to use the simple search method instead of this
one. Because, if you add the 14 special cases of search in your test youll have 50 x
50 x (14+1) = 37500 combinaisons to test. Imagine if you have 1000 Usernames & 1000
Passwords in your wordlists. It would take 15,000,000 of combinaisons.
Ouch ! ! ! ? ! !

No known troubleshoots for the
moment. If you find some bugs you can send a report.
Don't hesitate.Thanks!!!

|