Side-channel attacks following a classical differential power analysis (DPA) style are well understood, along with the effect the masking countermeasure has on them. However, simple attacks (SPA) where the target variable does not vary thanks to a known value, such as the plaintext, are less studied. In this paper, we investigate how the masking countermeasure affects the success rate of simple attacks. To this end, we provide theoretical, simulated, and practical experiments. Interestingly, we will see that masking can allow us to asymptotically recover more information on the secret than in the case of an unprotected implementation, depending on the masking type. We will see that this is true for masking encodings that add non-linearity with respect to the leakages, such as arithmetic masking, while it is not for Boolean masking. We believe this context provides interesting results, as the average information of arithmetic encoding is proven less informative than the Boolean one.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On the Success Rate of Simple Side-Channel Attacks Against Masking with Unlimited Attack Traces

  • Aymeric Hiltenbrand,
  • Julien Eynard,
  • Romain Poussier

摘要

Side-channel attacks following a classical differential power analysis (DPA) style are well understood, along with the effect the masking countermeasure has on them. However, simple attacks (SPA) where the target variable does not vary thanks to a known value, such as the plaintext, are less studied. In this paper, we investigate how the masking countermeasure affects the success rate of simple attacks. To this end, we provide theoretical, simulated, and practical experiments. Interestingly, we will see that masking can allow us to asymptotically recover more information on the secret than in the case of an unprotected implementation, depending on the masking type. We will see that this is true for masking encodings that add non-linearity with respect to the leakages, such as arithmetic masking, while it is not for Boolean masking. We believe this context provides interesting results, as the average information of arithmetic encoding is proven less informative than the Boolean one.