Masks will fall off. Higher-order optimal distinguishers

DOI10.1007/978-3-662-45608-8_19zbMATH Open1317.94090OpenAlexW2949648031MaRDI QIDQ2936617FDOQ2936617

Authors: Nicolas Bruneau, Sylvain Guilley, Annelie Heuser, Olivier Rioul 

Publication date: 6 January 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://telecom-paris.hal.science/hal-02287072

Recommendations

• The world is not enough: another look on second-order DPA
• How fast can higher-order masking be in software?
• A statistical model for higher order DPA on masked devices
• Topics in Cryptology – CT-RSA 2006
• Higher-order masking schemes for S-boxes

zbMATH Keywords

side-channel analysishigher-order maskingtemplate attackhigher-order optimal distinguisher (HOOD)masking tables

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (7)

• On the implementation efficiency of linear regression-based side-channel attacks
• Good is not good enough. Deriving optimal distinguishers from communication theory
• Taylor expansion of maximum likelihood attacks for masked and shuffled implementations
• Statistical properties of side-channel and fault injection attacks using coding theory
• Multivariate high-order attacks of shuffled tables recomputation
• Codes for side-channel attacks and protections
• Security evaluation against side-channel analysis at compilation time

This page was built for publication: Masks will fall off. Higher-order optimal distinguishers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936617)