TY - GEN
T1 - Ensuring tight computational security against higher-order DPA attacks
AU - Khurana, Dakshita
AU - Gaurav, Aditya
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011/8/31
Y1 - 2011/8/31
N2 - While DES has been proven to be breakable within a day given sufficient computational power, AES is still in use because it is extremely resistant to cryptanalytic attacks. Power Analytic Attacks use power consumption traces of the hardware or software implementation of these algorithms to reduce search space exponentially in the size of the key, thereby making computational complexity several orders of magnitude lower. This paper analyzes the increase in the computational advantage of an adversary who uses DPA and higher order power analysis attacks as opposed to algorithmic cryptanalysis. We highlight why there can be no perfect masking against DPA, and then define a standard for the security of masking countermeasures to such attacks. The main contribution is a security metric for systems and a cut-off for the number of encryptions allowable for a given order of masking to make the system immune to higher order DPA attacks.
AB - While DES has been proven to be breakable within a day given sufficient computational power, AES is still in use because it is extremely resistant to cryptanalytic attacks. Power Analytic Attacks use power consumption traces of the hardware or software implementation of these algorithms to reduce search space exponentially in the size of the key, thereby making computational complexity several orders of magnitude lower. This paper analyzes the increase in the computational advantage of an adversary who uses DPA and higher order power analysis attacks as opposed to algorithmic cryptanalysis. We highlight why there can be no perfect masking against DPA, and then define a standard for the security of masking countermeasures to such attacks. The main contribution is a security metric for systems and a cut-off for the number of encryptions allowable for a given order of masking to make the system immune to higher order DPA attacks.
KW - complexity of power analysis attacks
KW - computational security
KW - higher-order Differential Power Analysis (HO-DPA)
KW - higher-order masking
KW - security metric
UR - http://www.scopus.com/inward/record.url?scp=80052089450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052089450&partnerID=8YFLogxK
U2 - 10.1109/PST.2011.5971970
DO - 10.1109/PST.2011.5971970
M3 - Conference contribution
AN - SCOPUS:80052089450
SN - 9781457705847
T3 - 2011 9th Annual International Conference on Privacy, Security and Trust, PST 2011
SP - 96
EP - 101
BT - 2011 9th Annual International Conference on Privacy, Security and Trust, PST 2011
T2 - 2011 9th Annual International Conference on Privacy, Security and Trust, PST 2011
Y2 - 19 July 2011 through 21 July 2011
ER -