Python and Writing - Enhancing PenTest using Reachability Analysis

Job ID: 38675107

Budget: £10 – £20 GBP

Risk-based Vulnerability Management II – Reachability Analysis and Blast Radius
As a penetration tester, you have been tasked with analyzing and adapting a graph theory-based network
reachability [3] analysis solution for prioritizing vulnerability remediation prioritization as part of your
organization’s maturity model.
Description: The solution uses in-degree centrality in graph theory to develop a reachability metric for
vulnerability remediation prioritization. The implementation uses the Networkx library to calculate the
reachability of network-based vulnerabilities on IT assets, using sample data from firewall (management)
solutions, vulnerability management solutions and DHCP servers, and trust values for different
zones/subnets. Additional details about the description [1] and implementation [2] of the solution have
been provided. The starting code in Python and the output have also been provided as part of the files.
Tasks: Adapt the code to determine the ‘blast radius’ of an exploited vulnerability. Take reachability from
the same zone/subnet into account. You can apply exploit chaining
(https://cyberhoot.com/cybrary/exploit-chain/) or any other relevant methodology to address this task.
You are also permitted to generate additional appropriate sample data for your analysis. Using an evidence-
based scenario, discuss the integration of the reachability score and blast radius of an exploited
vulnerability into risk-based vulnerability management
Deliverables: Updated Code, Example result (table or graph) of the reachability analysis that includes the
blast radius, visited nodes, exploitable links and any other relevant output, and the discussion of
streamlining reachability score and blast radius with existing vulnerability prioritization metrics. This
information should be appended to the pdf document.
Note: This question requires the ability to understand and write code in Python, Basic TCP/IP knowledge,
graph theory and relevant design of the IT network.
References
1. Albert-Jan Talsma (2024): Data-driven Vulnerability Management: Graph Theory based
Reachability Analysis (1/2): https://medium.com/@a.talsma/data-driven-vulnerability-
management-graph-theory-based-reachability-analysis-1-2-61f2fe185339
2. Albert-Jan Talsma (2024): Data-driven Vulnerability Management: Graph Theory based
Reachability Analysis (2/2): https://medium.com/@a.talsma/data-driven-vulnerability-
management-graph-theory-based-reachability-analysis-2-2-4375e6a3de9c
3. Khakpour, A.R. and Liu, A.X., 2010, June. Quantifying and querying network reachability. In 2010
IEEE 30th International Conference on Distributed Computing Systems (pp. 817-826). IEEE. I require someone to verify my code and make changes if not correct and to complete the write up in 1 day.