Centrality Indicators for Efficient and Scalable Logic Masking

Abstract : Modifying the logic at register transfer level can help to protect a circuit against counterfeiting or illegal copying. By adding extra gates, the outputs can be controllably corrupted. Then the circuit operates correctly only if the right value is applied to the extra gates. The main challenge is to select the best position for these gates, to alter the circuit's behaviour as much as possible. However, another major point is the computational efficiency of the selection process, which should be as good as possible for integration in EDA tools. State-of-the art methods, based on fault analysis, are very demanding and cannot cope with large netlists in a reasonable runtime. We propose to use centrality indicators instead. Centrality is used to identify the most significant vertices of a graph. We show that, when used to select the nodes to modify, they lead to low correlation between original and altered outputs while being computationally efficient. We give experimental results on combinational benchmarks and compare to other previously proposed heuristics. We show that this method is the only efficient selection heuristic which is able to handle large netlists and integrate smoothly into EDA tools.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal-ujm.archives-ouvertes.fr/ujm-01570080
Contributor : Nathalie Bochard <>
Submitted on : Friday, July 28, 2017 - 12:11:56 PM
Last modification on : Tuesday, December 18, 2018 - 1:18:01 PM

File

ISVLSI_2017.pdf
Files produced by the author(s)

Identifiers

Citation

Brice Colombier, Lilian Bossuet, David Hely. Centrality Indicators for Efficient and Scalable Logic Masking. IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2017), IEEE, Jul 2017, Bochum, Germany. pp.98-103, ⟨10.1109/ISVLSI.2017.26⟩. ⟨ujm-01570080⟩

Share

Metrics

Record views

196

Files downloads

190