Compiler Assisted Masking
| Document type: | Conference Papers |
|---|---|
| Peer reviewed: | Yes |
| Full text: | |
| Author(s): | Andrew Moss, Elisabeth Oswald, dan Page, Michael Tunstall |
| Title: | Compiler Assisted Masking |
| Journal: | Lecture Notes in Computer Science |
| Conference name: | 14th International Workshop on Cryptographic Hardware and Embedded Systems, CHES |
| Year: | 2012 |
| Volume: | 7428 |
| Pagination: | 58-75 |
| ISSN: | 0302-9743 |
| Publisher: | Springer |
| URI/DOI: | 10.1007/978-3-642-33027-8_4 |
| Organization: | Blekinge Institute of Technology |
| Department: | School of Computing (Sektionen för datavetenskap och kommunikation) School of Computing S-371 79 Karlskrona +46 455 38 50 00 http://www.bth.se/com |
| Language: | English |
| 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. |
| Subject: | Computer Science\Electronic security Software Engineering\General |
| Keywords: | Compiler assisted cryptography; DPA; masking |
| Note: | Conference in Leuven 2012 |
