OWASP Tool Project D4N155
OWASP Tool Project D4N155The project uses OSINT for dynamic and smart attack of brute force, using a complex operation and get the word list using expressions find.
On the abstract we can presume that this isn’t just another pentest tool this is a truly powerful tool, that integrate various key features of another projects and ideas of the developers and aggregate then in a same place.
- Make smart wordlist based from page content
- Make smart wordlist based from specific url content
- Make smart wordlist based from past content
- FREE SOFTWARE IN LICENSE(GPL V3) AND IN ESSENCE
- Automatic Report Feature with two options:
- HTML Where it generate a dynamic graphic for quick visualization
People with bad intentions dedicate a long part of their time to read profiles, posts analyzing then, observing reactions with in order to obtain the maximum information about their targets in order to make their list (of passwords) and the door for attack. Even if you do not have specific knowledge, so you may be using this tool will help you get a sense of how vulnerable you are and consequently take action and prevent a possible attack.
Besides this it’s a friendly tool for a pentester with the features of automatics reports the professional can save time, writing extensive reports with pages of print screens, technician reports and transcription of procedures this tool can make a half of a job for him.
Operation of OWASP D4N155
The process of password speculation works based on the execution of several functions of theories mathematics.
All footwear is made following the recursion λ→(η) = Op.
The code follow the combinatorial analysis during the process of speculation
Enumerative combinatorics is the most classical area of combinatorics and concentrates on counting the number of certain combinatorial objects.
Using crawler are possible get all values for each all urls
Analytic combinatorics concerns the enumeration of combinatorial structures using tools from complex analysis and probability theory. In contrast with enumerative combinatorics, which uses explicit combinatorial formulae and generating functions to describe the results, analytic combinatorics aims at obtaining asymptotic formulae.
This is the most important thing for code.
With all the possibilities of combinations, example:
Root text: i walk ---- Tests ---- 1,1: walk i 1,2: walki 2,1: i walk 2,2: iwalk Removed repeated words ------------------------ walk i walki iwalk
Using this script are possible see in practical
with 4 values
wget -qO- "https://gist.githubusercontent.com/Jul10l1r4/a5edfae6b0f206b4e491152c9f6b4347/raw/6c246b3a32db2f19fe5c68394663a1c995d8f625/mess.py" | python3
Thanks for your interest in making D4N155 There are mutliple ways to help beyond just writing code:
- [Submit bugs and feature requests] with detailed information about your issue or idea.
- [Help fellow users with open issues] or [help fellow committers test recent pull requests].
Contributing to D4N155
If you want help for undestand the code contact us:
- firstname.lastname@example.org (Julio Lira)
- email@example.com (Matheus Oliveira)