Permutation Network De-obfuscation
Open Access
- 28 January 2020
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Journal on Emerging Technologies in Computing Systems
- Vol. 16 (2) , 1-25
Abstract
Permutation-based obfuscation has been proposed to protect hardware against cloning, overproduction, reverse engineering, and unauthorized operation. To prevent key extraction from memory, the key used by the obfuscation is usually stored in volatile memory. Since the key is erased after the system loses power, this scheme is often considered the best way to prevent a key from being stolen, since many attacks would require power. However, in this article, we propose a new attack where the key is determined by exploring path aging within the permutation network used for obfuscation. Both the theoretical analysis and experimental results are provided. A practical procedure to achieve the proposed attack is also discussed in the context of an attacker’s capabilities and knowledge. The proposed attack is executed in both simulation and hardware. The experimental results show the accuracy of identifying the key is over 80% and more than enough to reduce the number of brute-force combinations required by an attacker. This attack accuracy reaches 100% when the permutation network has experienced sufficient degradations. Besides the attack, we also propose a low-cost countermeasure that sweeps the permutation network configurations. Incorporating this countermeasure, the proposed attack becomes no better than brute-force guessing.Keywords
Funding Information
- US Army Research Of?ce (W911NF-16-1-0321)
This publication has 19 references indexed in Scilit:
- Evaluating the security of logic encryption algorithms2015
- IC Piracy prevention via Design Withholding and Entanglement2015
- Adaptive Technique for Overcoming Performance Degradation Due to Aging on 6T SRAM CellsIEEE Transactions on Device and Materials Reliability, 2014
- An accurate MOSFET aging model for 28nm integrated circuit simulationMicroelectronics Reliability, 2012
- Arbitrary Size Benes NetworksParallel Processing Letters, 1997
- A study of non blocking multicast switching networksIEEE Transactions on Communications, 1995
- Wide-Sense Nonblocking NetworksSIAM Journal on Discrete Mathematics, 1988
- Randomized parallel communications on an extension of the omega networkJournal of the ACM, 1987
- On rearrangeable and non-blocking switching networksJournal of Computer and System Sciences, 1978
- A Permutation NetworkJournal of the ACM, 1968