TY - JOUR
T1 - SCARE and power attack on AES-like block ciphers with secret S-box
AU - Liu, Xin
AU - Wang, An
AU - Zhu, Liehuang
AU - Ding, Yaoling
AU - Lyu, Zeyuan
AU - Wang, Zongyue
N1 - Publisher Copyright:
© 2022, Higher Education Press.
PY - 2022/8
Y1 - 2022/8
N2 - Despite Kerckhoff’s principle, there are secret ciphers with unknown components for diplomatic or military usages. The side-channel analysis of reverse engineering (SCARE) is developed for analyzing secret ciphers. Considering the side-channel leakage, SCARE attacks enable the recovery of some secret parts of a cryptosystem, e.g., the substitution box table. However, based on idealized leakage assumption, most of these attacks have a few limitations on prior knowledge or implementations. In this paper, we focus on AES-like block ciphers with a secret S-box and demonstrate an attack which recovers both the secret key and the secret S-box. On the one hand, the key is recovered under profiled circumstance by leakage analysis and collision attack. On the other hand, the SCARE attack is based on mathematical analysis. It relies on Hamming weight of MixColumns intermediate results in the first round, which can restore the secret S-box. Experiments are performed on real power traces from a software implementation of AES-like block cipher. Moreover, we evaluate the soundness and efficiency of our method by simulations and compare with previous approaches. Our method has more advantages in intermediate results location and the required number of traces. For simulated traces with gaussian noise, our method requires 100000 traces to fully restore the secret S-box, while the previous method requires nearly 300000 traces to restore S-box.
AB - Despite Kerckhoff’s principle, there are secret ciphers with unknown components for diplomatic or military usages. The side-channel analysis of reverse engineering (SCARE) is developed for analyzing secret ciphers. Considering the side-channel leakage, SCARE attacks enable the recovery of some secret parts of a cryptosystem, e.g., the substitution box table. However, based on idealized leakage assumption, most of these attacks have a few limitations on prior knowledge or implementations. In this paper, we focus on AES-like block ciphers with a secret S-box and demonstrate an attack which recovers both the secret key and the secret S-box. On the one hand, the key is recovered under profiled circumstance by leakage analysis and collision attack. On the other hand, the SCARE attack is based on mathematical analysis. It relies on Hamming weight of MixColumns intermediate results in the first round, which can restore the secret S-box. Experiments are performed on real power traces from a software implementation of AES-like block cipher. Moreover, we evaluate the soundness and efficiency of our method by simulations and compare with previous approaches. Our method has more advantages in intermediate results location and the required number of traces. For simulated traces with gaussian noise, our method requires 100000 traces to fully restore the secret S-box, while the previous method requires nearly 300000 traces to restore S-box.
KW - AES
KW - SCARE
KW - cryptography
KW - secret S-box
KW - side-channel analysis
UR - http://www.scopus.com/inward/record.url?scp=85119091272&partnerID=8YFLogxK
U2 - 10.1007/s11704-020-0319-z
DO - 10.1007/s11704-020-0319-z
M3 - Article
AN - SCOPUS:85119091272
SN - 2095-2228
VL - 16
JO - Frontiers of Computer Science
JF - Frontiers of Computer Science
IS - 4
M1 - 164814
ER -