This paper proposes a new accurate evaluation method for examining the resistance of cryptographic implementations against access-driven cache attacks (CAs). We show that a mathematical correlation method between the sets of measured access time and the ideal data, which depend on the guessed key, can be utilized to evaluate quantitatively the correct key in access-driven CAs. We show the effectiveness of the proposed method using the access time measured in noisy environments. We also estimate the number of key candidates based on mathematical proof while considering memory allocation. Furthermore, based on the proposed method, we analyze quantitatively how the correlation values change with the number of plaintexts for a successful attack.
Junko TAKAHASHI
NTT Corporation
Toshinori FUKUNAGA
NTT Corporation
Kazumaro AOKI
NTT Corporation
Hitoshi FUJI
NTT Corporation
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Junko TAKAHASHI, Toshinori FUKUNAGA, Kazumaro AOKI, Hitoshi FUJI, "Evaluation Method for Access-Driven Cache Attacks Using Correlation Coefficient" in IEICE TRANSACTIONS on Fundamentals,
vol. E98-A, no. 1, pp. 192-202, January 2015, doi: 10.1587/transfun.E98.A.192.
Abstract: This paper proposes a new accurate evaluation method for examining the resistance of cryptographic implementations against access-driven cache attacks (CAs). We show that a mathematical correlation method between the sets of measured access time and the ideal data, which depend on the guessed key, can be utilized to evaluate quantitatively the correct key in access-driven CAs. We show the effectiveness of the proposed method using the access time measured in noisy environments. We also estimate the number of key candidates based on mathematical proof while considering memory allocation. Furthermore, based on the proposed method, we analyze quantitatively how the correlation values change with the number of plaintexts for a successful attack.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.192/_p
Copy
@ARTICLE{e98-a_1_192,
author={Junko TAKAHASHI, Toshinori FUKUNAGA, Kazumaro AOKI, Hitoshi FUJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Evaluation Method for Access-Driven Cache Attacks Using Correlation Coefficient},
year={2015},
volume={E98-A},
number={1},
pages={192-202},
abstract={This paper proposes a new accurate evaluation method for examining the resistance of cryptographic implementations against access-driven cache attacks (CAs). We show that a mathematical correlation method between the sets of measured access time and the ideal data, which depend on the guessed key, can be utilized to evaluate quantitatively the correct key in access-driven CAs. We show the effectiveness of the proposed method using the access time measured in noisy environments. We also estimate the number of key candidates based on mathematical proof while considering memory allocation. Furthermore, based on the proposed method, we analyze quantitatively how the correlation values change with the number of plaintexts for a successful attack.},
keywords={},
doi={10.1587/transfun.E98.A.192},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Evaluation Method for Access-Driven Cache Attacks Using Correlation Coefficient
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 192
EP - 202
AU - Junko TAKAHASHI
AU - Toshinori FUKUNAGA
AU - Kazumaro AOKI
AU - Hitoshi FUJI
PY - 2015
DO - 10.1587/transfun.E98.A.192
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2015
AB - This paper proposes a new accurate evaluation method for examining the resistance of cryptographic implementations against access-driven cache attacks (CAs). We show that a mathematical correlation method between the sets of measured access time and the ideal data, which depend on the guessed key, can be utilized to evaluate quantitatively the correct key in access-driven CAs. We show the effectiveness of the proposed method using the access time measured in noisy environments. We also estimate the number of key candidates based on mathematical proof while considering memory allocation. Furthermore, based on the proposed method, we analyze quantitatively how the correlation values change with the number of plaintexts for a successful attack.
ER -