• optimization algorithms
• attack graph
• hash table
• information security

The work done is the implementation of a Hash Attack Graph realized for the simulator Haruspex v2 with the aim to optimize, in terms of time and memory, the performance of the simulator. From a first analysis of the structure of the graph and
of algorithms used in the version of the simulator taken into consideration, a solution based on the adjacency-list representation of the graph and on the use of a hash table for temporary storage of the information needed to construct the graph was developed. The results obtained from a sample of simulations have demonstrated the efficiency of the solution measuring how time and memory are used in the whole simulation process,comparing them with some critical points of the version of the simulator examined.