Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability.
Harsh VamjaRicha AgrawalRanga VemuriPublished in: MWSCAS (2019)
Keyphrases
- finite state machines
- reverse engineering
- boolean satisfiability
- power analysis
- countermeasures
- smart card
- sat solvers
- software engineering
- probabilistic planning
- branch and bound algorithm
- symmetry breaking
- model checking
- randomly generated
- integer linear programming
- object oriented
- sat problem
- max sat
- elliptic curve
- combinatorial problems
- hidden markov models
- branch and bound
- block cipher
- lower bound
- information systems
- sat instances
- state space
- phase transition
- upper bound
- databases
- satisfiability problem
- boolean formula
- planning under uncertainty
- constraint programming
- constraint satisfaction
- orders of magnitude
- np complete