Name
Abstract | ||
|---|---|---|
Masking is a very common countermeasure against side channel attacks. When combining Boolean and arithmetic masking, one must be able to convert between the two types of masking, and the conversion algorithm itself must be secure against side-channel attacks. An efficient high-order Boolean to arithmetic conversion scheme was recently described at CHES 2017, with complexity independent of the register size. In this paper we describe a simplified variant with fewer mask refreshing, and still with a proof of security in the ISW probing model. In practical implementations, our variant is roughly 25% faster. |
Year | Venue | DocType |
|---|---|---|
2018 | IACR Cryptology ePrint Archive | Journal |
Volume | Issue | Citations |
2018 | 2 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luk Bettale | 1 | 111 | 7.18 |
| Jean-Sébastien Coron | 2 | 2655 | 164.74 |
| Rina Zeitoun | 3 | 4 | 3.12 |