| 1 |
DIRB FAQ |
| 2 |
======== |
| 3 |
|
| 4 |
Questions: |
| 5 |
|
| 6 |
1) Can I use multiple wordfiles at a time? |
| 7 |
|
| 8 |
2) I Know 3 directories exist, how can I scan them? |
| 9 |
|
| 10 |
3) I'm newbie in security testing. Is DIRB an easy tool? |
| 11 |
|
| 12 |
4) Can DIRB find or exploit vulnerabilities? |
| 13 |
|
| 14 |
5) Can you include a description of each item found? |
| 15 |
|
| 16 |
6) I'm desperate. I've used all the avaliable CGI scanners against a |
| 17 |
webserver and they don't found anything. DIRB can give me some hope? |
| 18 |
|
| 19 |
7) Can DIRB be used like a classical CGI scanner? |
| 20 |
|
| 21 |
8) What is the NOT_FOUND code? |
| 22 |
|
| 23 |
9) What about a multi-thread version? |
| 24 |
|
| 25 |
|
| 26 |
#################################################### |
| 27 |
|
| 28 |
|
| 29 |
1) Can I use multiple wordfiles at a time? |
| 30 |
|
| 31 |
YES, the wordfile parameter lets you specify multiple files separated by |
| 32 |
coma: "," |
| 33 |
|
| 34 |
Example: |
| 35 |
|
| 36 |
$./dirb http://www.site.com/ wordlist1.txt,wordlist2.txt,wordlist3.txt |
| 37 |
|
| 38 |
|
| 39 |
2) I know 3 directories exist, how can I scan them? |
| 40 |
|
| 41 |
You have 2 options: |
| 42 |
|
| 43 |
- Scan directly each directory. For example: |
| 44 |
|
| 45 |
$./dirb http://www.site.com/directory1/ wordlist.txt |
| 46 |
|
| 47 |
$./dirb http://www.site.com/directory2/ wordlist.txt |
| 48 |
|
| 49 |
$./dirb http://www.site.com/directory3/ wordlist.txt |
| 50 |
|
| 51 |
- Include the name of the 3 directories in a text file (one directory by line) |
| 52 |
and use it like a wordfile. DIRB will found the directories and scan into it. |
| 53 |
For example: |
| 54 |
|
| 55 |
$./dirb http://www.site.com/ wordlist.txt,dirnamefile.txt |
| 56 |
|
| 57 |
Content of dirnamefile.txt: |
| 58 |
---------------- |
| 59 |
directory1 |
| 60 |
directory2 |
| 61 |
directory3 |
| 62 |
---------------- |
| 63 |
|
| 64 |
|
| 65 |
3) I'm newbie in security testing. Is DIRB an easy tool? |
| 66 |
|
| 67 |
NO. DIRB is a tool for automating the search of (normally hidden) web |
| 68 |
applications. But once you have found them, you need a good knowledge on |
| 69 |
security and penetration testing to get advantage of this information. |
| 70 |
|
| 71 |
|
| 72 |
4) Can DIRB find or exploit vulnerabilities? |
| 73 |
|
| 74 |
NO. DIRB look for web objects. To determine if they are vulnerable or not, |
| 75 |
you must use your own intelligence or other kind of tool. |
| 76 |
|
| 77 |
|
| 78 |
5) Can you include a description of each item found? |
| 79 |
|
| 80 |
NO. DIRB scan generic contents. I don't know what exists behind each one. |
| 81 |
Maybe some administrator use a file named "test.asp" as his main |
| 82 |
administration menu or simply is a "hello world" script... |
| 83 |
|
| 84 |
|
| 85 |
|
| 86 |
6) I'm desperate. I've used all the avaliable CGI scanners against a |
| 87 |
webserver and they don't found anything. DIRB can give me some hope? |
| 88 |
|
| 89 |
YES. DIRB can found something that classic CGI scanners can't found. Maybe |
| 90 |
it's your last chance. |
| 91 |
|
| 92 |
|
| 93 |
7) Can DIRB be used like a classical CGI scanner? |
| 94 |
|
| 95 |
YES. You only need to define a wordlist with common vulnerable CGI names, and |
| 96 |
feed this wordfile into DIRB. (The default dirb distribution comes |
| 97 |
with a wordfile for this usage: "wordlists/vulns/cgis.txt") |
| 98 |
|
| 99 |
|
| 100 |
8) What is the NOT_FOUND code? |
| 101 |
|
| 102 |
NOT_FOUND is the response code that gives a webserver for not existant pages or |
| 103 |
documents. DIRB use this code to locate only the correct existant pages and |
| 104 |
eliminate the rest. By default most webservers use code 404 (Page not found) |
| 105 |
but in some cases the NOT_FOUND code is not 404 and most CGI scanners will fail |
| 106 |
in detecting existing pages. |
| 107 |
|
| 108 |
|
| 109 |
9) What about a multi-thread version? |
| 110 |
|
| 111 |
I have tested a simplified demo version of dirb running multiple threads and |
| 112 |
the speed gain was about 20-40%. This improvement is not significant and the |
| 113 |
complexity of the code does it (by now) not very useful. |
| 114 |
|
| 115 |
|
| 116 |
|