Theoretical analysis of gate level information flow tracking

Jason Oberg, Wei Hu, Ali Irturk, Mohit Tiwari, Timothy Sherwood, Ryan Kastner
[doi] [Google Scholar] [DBLP] [Citeseer]
Read: 06 October 2019

Proceedings of the 47th Design Automation Conference
Pages 244-247
Note(s): hardware, information flow

GLIFT (Gate Level Information Flow Tracking) calculates a precise “taint” bit for every signal indicating whether the signal depends on some input signals. GLIFT is added by calculating taint for each primitive gate type (and, or, XOR, not) with an assumption of linearity. This paper looks at how the number of midterms grows with circuit complexity for 1-8 bit adder, multiplier, comparator, shifter and multiplexer. All costs are exponential and quite high.

Questions: Can linearity assumption be justified? Is number of midterms the right metric?