CPU caches introduce variations into the execution time of programs that can be exploited by adversaries to recover private information about users or cryptographic keys. Establishing the security of countermeasures against this threat often requires intricate reasoning about the interac- tions of program code, memory layout, and hardware archi- tecture and has so far only been done for restricted cases. In this paper we devise novel techniques that provide sup- port for bit-level and arithmetic reasoning about memory ac- cesses in the presence of dynamic memory allocation. These techniques enable us to perform the first rigorous analysis of widely deployed software countermeasures against cache at- tacks on modular exponentiation, based on executable code.
cacheaudit 'at' software 'dot' imdea 'dot' org