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