Compiler Assisted Masking
2012 (English)In: Lecture Notes in Computer Science, Springer , 2012, Vol. 7428, 58-75 p.Conference paper (Refereed) Published
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.
Place, publisher, year, edition, pages
Springer , 2012. Vol. 7428, 58-75 p.
Compiler assisted cryptography, DPA, masking
Software Engineering Computer Science
IdentifiersURN: urn:nbn:se:bth-7057DOI: 10.1007/978-3-642-33027-8_4Local ID: oai:bth.se:forskinfo8AE1BA8441C1E260C1257AC60049E93BOAI: oai:DiVA.org:bth-7057DiVA: diva2:834636
14th International Workshop on Cryptographic Hardware and Embedded Systems, CHES
Conference in Leuven 20122012-12-212012-11-302015-06-30Bibliographically approved