2018 IEEE 3rd International Verification and Security Workshop (IVSW) 2018
DOI: 10.1109/ivsw.2018.8494896
|View full text |Cite
|
Sign up to set email alerts
|

Reverse Engineering of Cryptographic Cores by Structural Interpretation Through Graph Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 23 publications
(3 citation statements)
references
References 1 publication
0
3
0
Order By: Relevance
“…Werner et al [78] apply the Louvain method for graph partitioning to iteratively optimize the quality of the partition of the network, which is also called modularity. Initially, each vertex is treated as its own cluster.…”
Section: Circuit Partitioningmentioning
confidence: 99%
“…Werner et al [78] apply the Louvain method for graph partitioning to iteratively optimize the quality of the partition of the network, which is also called modularity. Initially, each vertex is treated as its own cluster.…”
Section: Circuit Partitioningmentioning
confidence: 99%
“…This is a divide-and-conquer approach to analyse all submodules separately. Various approaches for netlist partitioning exist, like for example separation along the data path by word identification [16], functional block identification [17] or graph partitioning [18]. Input/Output (I/O) Signal Identification.…”
Section: Functional Re -Netlist Abstractionmentioning
confidence: 99%
“…7. Netlist Abstraction: Abstraction is done, for instance, by structural graph-analysis [18] or structural block analysis [19].…”
Section: A Hardware Reverse Engineeringmentioning
confidence: 99%