Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability

08/06/2019
by   Harsh Vamja, et al.
0

In this paper, we present a non-invasive reverse engineering attack based on a novel approach that combines functional and power analysis to recover finite state machines from their synchronous sequential circuit implementations. The proposed technique formulates the machine exploration and state identification problem as a Boolean constraint satisfaction problem and solves it using a SMT (Satisfiability Modulo Theories) solver. It uses power measurements to achieve fast convergence. Experimental results using the LGSynth'91 benchmark suite show that the satisfiability-based approach is several times faster compared to existing techniques and can successfully recover 90 a target machine.

READ FULL TEXT
research
12/07/2021

The VLSAT-3 Benchmark Suite

This report presents VLSAT-3 (an acronym for "Very Large Boolean SATisfi...
research
05/05/2023

Hardware Honeypot: Setting Sequential Reverse Engineering on a Wrong Track

Reverse engineering of finite state machines is a serious threat when pr...
research
01/16/2014

Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories

The problem of finding small unsatisfiable cores for SAT formulas has re...
research
04/15/2020

Computing Tropical Prevarieties with Satisfiability Modulo Theories (SMT) Solvers

A novel way to use SMT (Satisfiability Modulo Theories) solvers to compu...
research
02/08/2020

SAT-Based ATL Satisfiability Checking

Synthesis of models and strategies is a very important problem in softwa...
research
05/07/2014

Structured Learning Modulo Theories

Modelling problems containing a mixture of Boolean and numerical variabl...
research
09/09/2011

Generalizing Boolean Satisfiability III: Implementation

This is the third of three papers describing ZAP, a satisfiability engin...

Please sign up or login with your details

Forgot password? Click here to reset