dc.contributor.advisor |
Falcarin, Paolo |
it_IT |
dc.contributor.author |
Visentin, Thomas <1996> |
it_IT |
dc.date.accessioned |
2022-09-26 |
it_IT |
dc.date.accessioned |
2023-02-22T10:57:01Z |
|
dc.date.issued |
2022-10-21 |
it_IT |
dc.identifier.uri |
http://hdl.handle.net/10579/22358 |
|
dc.description.abstract |
The aim of the thesis is to understand how the various obfuscation techniques among those provided by the Tigress software increase the complexity of the code and therefore are therefore to be preferred to avoid reverse engineering attacks.
Preliminarily, an analysis is carried out to identify among the numerous obfuscation transformations provided by Tigress, the most significant for the set objective, as using a "brute force" technique it would in fact be possible to test them all, so we proceeded with those that they would have modified the flow control chart more heavily.
To achieve this goal, the complexity of the source code obtained after the application of such obfuscations is used in some case studies considered significant (sorting, cryptographic and machine learning algorithm).
To measure the complexity of the code, cyclomatic complexity (McCabe, 1976) and Halstead complexity (1977) were used.
Once these results have been obtained, a statistical analysis is carried out in order to identify the maximum value for each metric considered, and then a process of normalization of the values is applied.
Subsequently a derived and relative metric is provided, which will be called "total complexity" in order to understand within a specific case study the goodness or otherwise of a certain obfuscation compared to the best possible result achieved by applying all possible obfuscations. |
it_IT |
dc.language.iso |
en |
it_IT |
dc.publisher |
Università Ca' Foscari Venezia |
it_IT |
dc.rights |
© Thomas Visentin, 2022 |
it_IT |
dc.title |
Obfuscation complexity optimization |
it_IT |
dc.title.alternative |
Obfuscation complexity optimization |
it_IT |
dc.type |
Master's Degree Thesis |
it_IT |
dc.degree.name |
Informatica - computer science |
it_IT |
dc.degree.level |
Laurea magistrale |
it_IT |
dc.degree.grantor |
Dipartimento di Scienze Ambientali, Informatica e Statistica |
it_IT |
dc.description.academicyear |
2021-2022_appello_171022 |
it_IT |
dc.rights.accessrights |
closedAccess |
it_IT |
dc.thesis.matricno |
869438 |
it_IT |
dc.subject.miur |
INF/01 INFORMATICA |
it_IT |
dc.description.note |
|
it_IT |
dc.degree.discipline |
|
it_IT |
dc.contributor.co-advisor |
|
it_IT |
dc.date.embargoend |
10000-01-01 |
|
dc.provenance.upload |
Thomas Visentin (869438@stud.unive.it), 2022-09-26 |
it_IT |
dc.provenance.plagiarycheck |
Paolo Falcarin (paolo.falcarin@unive.it), 2022-10-17 |
it_IT |