You are looking at a specific version 20220519:102638 of this paper. See the latest version.

Paper 2022/325

FPGA Design Deobfuscation by Iterative LUT Modification at Bitstream Level

Michail Moraitis and Elena Dubrova

Abstract

Hardware obfuscation by redundancy addition is a well-known countermeasure against reverse engineering. For FPGA designs, such a technique can be implemented with a small overhead, however, its effectiveness is heavily dependent on the stealthiness of the redundant elements. Since there are powerful tools for combinational redundancy removal, opting for sequential redundancy is believed to result in stronger obfuscation. However, in this paper, we demonstrate that it is possible to identify sequential redundancy in obfuscated SRAM FPGA designs by ensuring the full controllability of each instantiated look-up table input via iterative bitstream modification. The presented algorithm works directly on bitstream and does not require the possession of a flattened netlist. The feasibility of our approach is verified on the example of an obfuscated SNOW 3G design implemented in a Xilinx 7-series FPGA.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Major revision. European Test Symposium 2022
Keywords
Obfuscationhardware opaque predicateSRAM FPGAbitstream modificationreverse engineering.
Contact author(s)
micmor @ kth se
History
2022-09-20: last of 2 revisions
2022-03-14: received
See all versions
Short URL
https://ia.cr/2022/325
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.