Abstract
Differential Power Analysis (DPA) attacks find a statistical correlation between the power consumption of a cryptographic device and intermediate values within the computation. Randomization via (Boolean) masking of intermediate values breaks this statistical dependence and thus prevents such attacks (at least up to a certain order). Especially for software implementations, (first-order) masking schemes are popular in academia and industry, albeit typically not as the sole countermeasure. The current practice then is to manually 'insert' Boolean masks: essentially software developers need to manipulate low-level assembly language to implement masking. In this paper we make a first step to automate this process, at least for first-order Boolean masking, allowing the development of compilers capable of protecting programs against DPA. © 2012 International Association for Cryptologic Research.
Author supplied keywords
Cite
CITATION STYLE
Moss, A., Oswald, E., Page, D., & Tunstall, M. (2012). Compiler assisted masking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7428 LNCS, pp. 58–75). Springer Verlag. https://doi.org/10.1007/978-3-642-33027-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.