Automated Hardware Trojan Insertion in Industrial-Scale Designs
Not on the map. Why?
Abstract (arXiv)
Industrial Systems-on-Chips (SoCs) often comprise hundreds of thousands to millions of nets and millions to tens of millions of connectivity edges, making empirical evaluation of hardware-Trojan (HT) detectors on realistic designs both necessary and difficult. Public benchmarks remain significantly smaller and hand-crafted, while releasing truly malicious RTL raises ethical and operational risks. This work presents an automated and scalable methodology for generating HT-like patterns in industry-scale netlists whose purpose is to stress-test detection tools without altering user-visible functionality. The pipeline (i) parses large gate-level designs into connectivity graphs, (ii) explores rare regions using SCOAP testability metrics, and (iii) applies parameterized, function-preserving graph transformations to synthesize trigger-payload pairs that mimic the statistical footprint of stealthy HTs. When evaluated on the benchmarks generated in this work, representative state-of-the-art graph-learning models fail to detect Trojans. The framework closes the evaluation gap between academic circuits and modern SoCs by providing reproducible challenge instances that advance security research without sharing step-by-step attack instructions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 11 Nov 2025.
Builds on
5 of 24 references.
References · 5
- 2021HW2VEC: A Graph Learning Tool for Automating Hardware Securitycited by 16
- 2023TrojanSAINT: Gate-Level Netlist Sampling-Based Inductive Learning for Hardware Trojan Detectioncited by 9
- 2018Hardware Trojan Detection through Information Flow Security Verificationcited by 6
- 2022AdaTest:Reinforcement Learning and Adaptive Sampling for On-chip Hardware Trojan Detectioncited by 6
- 2021Node-wise Hardware Trojan Detection Based on Graph Learningcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.