TY - JOUR
T1 - A new Framework for Constraint-Based Probabilistic Template Side Channel Attacks
AU - Oren, Yossef
AU - Weisse, Ofir
AU - Wool, Avishai
N1 - Publisher Copyright:
© International Association for Cryptologic Research 2014.
PY - 2014
Y1 - 2014
N2 - The use of constraint solvers, such as SAT- or Pseudo- Boolean-solvers, allows the extraction of the secret key from one or two side-channel traces. However, to use such a solver the cipher must be represented at bit-level. For byte-oriented ciphers this produces very large and unwieldy instances, leading to unpredictable, and often very long, run times. In this paper we describe a specialized byte-oriented constraint solver for side channel cryptanalysis. The user only needs to supply code snippets for the native operations of the cipher, arranged in a flow graph that models the dependence between the side channel leaks. Our framework uses a soft decision mechanism which overcomes realistic measurement noise and decoder classification errors, through a novel method for reconciling multiple probability distributions. On the DPA v4 contest dataset our framework is able to extract the correct key from one or two power traces in under 9 seconds with a success rate of over 79%.
AB - The use of constraint solvers, such as SAT- or Pseudo- Boolean-solvers, allows the extraction of the secret key from one or two side-channel traces. However, to use such a solver the cipher must be represented at bit-level. For byte-oriented ciphers this produces very large and unwieldy instances, leading to unpredictable, and often very long, run times. In this paper we describe a specialized byte-oriented constraint solver for side channel cryptanalysis. The user only needs to supply code snippets for the native operations of the cipher, arranged in a flow graph that models the dependence between the side channel leaks. Our framework uses a soft decision mechanism which overcomes realistic measurement noise and decoder classification errors, through a novel method for reconciling multiple probability distributions. On the DPA v4 contest dataset our framework is able to extract the correct key from one or two power traces in under 9 seconds with a success rate of over 79%.
KW - Constraint solvers
KW - Power analysis
KW - Template attacks
UR - http://www.scopus.com/inward/record.url?scp=84921448977&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-44709-3_2
DO - 10.1007/978-3-662-44709-3_2
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84921448977
SN - 0302-9743
VL - 8731
SP - 17
EP - 34
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -