You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
Yigit Colakoglu 21b1871872 Removed debug printf 3 years ago
.gitignore Initial commit 4 years ago
Makefile Initial commit 4 years ago
README.md Random parameter value support 4 years ago
linkedlist.c Random parameter value support 4 years ago
linkedlist.h Red-Black self balancing tree implemented. 4 years ago
massurl Random parameter value support 4 years ago
massurl.c Removed debug printf 3 years ago
test.data Initial commit 4 years ago
tree.c Random parameter value support 4 years ago
tree.h Red-Black self balancing tree implemented. 4 years ago
urlparse.c Random parameter value support 4 years ago
urlparse.h Red-Black self balancing tree implemented. 4 years ago

README.md

massurl

massurl is a simple tool that aims to parse the outputs of tools like gau, and extract the parameters for each URL, remove duplicates and do it all very quickly. Because web scraping tools' outputs can get very large very quickly, it is nice to have a tool that parses them and and outputs something clean and easy to read.

How to use?

Simply clone the git repository and run make which outputs the binary massurl. You can then simply pipe the output of any command that outputs urls into it or pass the filename where you want it to read the urls from. It expects each line to have only one url. It has several parameters:

usage: massurl [-r] [-v] [-o outfile] [-p payloads] [-n minparamnum] input_file

You can specify an output file, which it will write instead of stdout, you can also give it a list of payloads which massurl will automatically enter as the values for each parameter. If you are testing for reflected values, in parameters, you can put a pseudorandom value in each param using the flag -r. And finally, you can specify the minimum amount of parameters a url must have to be outputted, this value is zero by default but I recommend you use 1.

How fast is it?

The tool uses a binary tree to store the urls and keeps it balanced using the red-black self balancing tree algorithm, which allows it to run at incredible speeds.

Contributing

This is a very simple project so you shouldn't have trouble reading the code and fixing the bugs you encounter. If you do so, feel free to send a PR. Or, if you can't seem to fix it yourself, don't be shy and open an issue!