Distributed concurrent network enumeration system
AETH-erial
9847fad52c
fixed memory leak! as well as improved the overall memory usage of the program. lookin good!
|
il y a 6 mois | |
|---|---|---|
| cmd | il y a 6 mois | |
| pkg | il y a 6 mois | |
| test | il y a 7 mois | |
| .gitignore | il y a 6 mois | |
| LICENSE | il y a 7 mois | |
| Makefile | il y a 6 mois | |
| README.md | il y a 9 mois | |
| go.mod | il y a 6 mois | |
| go.sum | il y a 6 mois |
README.md
Working on a network observability tool. Architecting it as a peer-to-peer network, each node on the p2p network performs host scans on addresses within its own address space, and reports back to a central client that establishes itself as the broker for that round of scanning. Going to use this project as a way to explore network enumeration, distributed system resilience, and concurrent programming at large scale.
Since any node on the network can act as a C2/master/broker server, I want to disperse the scanning data via a torrent network between nodes, so that the speed of replication scales with the size of the network.
Im also attempting to solve the problem of scanning hosts on a large network with rotating IPs, so that when a network/host sweep is executed, the amount of time that a mapping of the network is accurate is extended. I'm attempting to combat this by:
- designing this is a scalable distributed system
- utilizing the strong concurrent features of Golang
- utilizing the torrent protocol to distribute data so that state changes can easily be reflected across nodes.