Testing side-channel security of cryptographic implementations against future microarchitectures
Gilles Barthe, Marcel Böhme, Sunjay Cauligi, Chitchanok Chuengsatiansup, Daniel Genkin, Marco Guarnieri, David Mateos Romero, Peter Schwabe, David Wu, Yuval Yarom
TL;DR
The paper tackles how future microarchitectures could introduce side-channel leaks in cryptographic implementations. It introduces Lm-Spec, a domain-specific language for modeling leakage and speculative execution, and Lm-Test, a framework for automatically detecting secret-dependent leaks via relational testing. Through a large-scale case study of 18 optimizations across 25 cryptographic implementations, the authors show that many real libraries would leak under these future proposals, including leaks arising from coding idioms designed to be constant-time. The work provides a practical, extensible approach for hardware and software designers to evaluate and mitigate microarchitectural leakage risks early in the development cycle.
Abstract
How will future microarchitectures impact the security of existing cryptographic implementations? As we cannot keep reducing the size of transistors, chip vendors have started developing new microarchitectural optimizations to speed up computation. A recent study (Sanchez Vicarte et al., ISCA 2021) suggests that these optimizations might open the Pandora's box of microarchitectural attacks. However, there is little guidance on how to evaluate the security impact of future optimization proposals. To help chip vendors explore the impact of microarchitectural optimizations on cryptographic implementations, we develop (i) an expressive domain-specific language, called LmSpec, that allows them to specify the leakage model for the given optimization and (ii) a testing framework, called LmTest, to automatically detect leaks under the specified leakage model within the given implementation. Using this framework, we conduct an empirical study of 18 proposed microarchitectural optimizations on 25 implementations of eight cryptographic primitives in five popular libraries. We find that every implementation would contain secret-dependent leaks, sometimes sufficient to recover a victim's secret key, if these optimizations were realized. Ironically, some leaks are possible only because of coding idioms used to prevent leaks under the standard constant-time model.
