TY - JOUR
T1 - Bridging Lab and Industry
T2 - Practical SPA-GPT on Cryptosystems Boosted by LSTM and Simulated Annealing
AU - Wang, Ziyu
AU - Ding, Yaoling
AU - Wang, An
AU - Wei, Congming
AU - Zhang, Jingqi
AU - Zhu, Liehuang
N1 - Publisher Copyright:
© 2005-2012 IEEE.
PY - 2026
Y1 - 2026
N2 - Simple Power Analysis is a commonly used method in Side-Channel Analysis on cryptosystems, which requires a significant amount of labor costs for segmentation. General Pulse Tailor for Simple Power Analysis (SPA-GPT) proposed in CHES 2024 utilizes reinforcement learning to achieve automated segmentation. However, its low efficiency and only targeting public-key algorithms limit its practical applications. In this paper, we propose a practical method, which utilize long short-term memory network and attention mechanism, coupled with a new deep Q-network policy using Simulated Annealing strategy, to solve the contradiction between reinforcement learning and high efficiency in trace segmentation. Moreover, the novel agent proposed in this paper also demonstrates transferability, enabling direct segmentation of a trace under varying lengths and signal-to-noise ratio conditions once the agent has been fully trained. In addition, our new approach is applicable for locating each execution of block ciphers in various encryption modes. Comparative experiments are conducted on 14 datasets, which are collected from software or hardware implementations of RSA, ECC, ML-KEM, AES, PRESENT, and SIMON, running on microcontrollers, FPGAs, or smart cards. Experimental results show that the new method enhances time efficiency by 50.34% to 94.24% while reducing network parameters by 87.84% compared to SPA-GPT.
AB - Simple Power Analysis is a commonly used method in Side-Channel Analysis on cryptosystems, which requires a significant amount of labor costs for segmentation. General Pulse Tailor for Simple Power Analysis (SPA-GPT) proposed in CHES 2024 utilizes reinforcement learning to achieve automated segmentation. However, its low efficiency and only targeting public-key algorithms limit its practical applications. In this paper, we propose a practical method, which utilize long short-term memory network and attention mechanism, coupled with a new deep Q-network policy using Simulated Annealing strategy, to solve the contradiction between reinforcement learning and high efficiency in trace segmentation. Moreover, the novel agent proposed in this paper also demonstrates transferability, enabling direct segmentation of a trace under varying lengths and signal-to-noise ratio conditions once the agent has been fully trained. In addition, our new approach is applicable for locating each execution of block ciphers in various encryption modes. Comparative experiments are conducted on 14 datasets, which are collected from software or hardware implementations of RSA, ECC, ML-KEM, AES, PRESENT, and SIMON, running on microcontrollers, FPGAs, or smart cards. Experimental results show that the new method enhances time efficiency by 50.34% to 94.24% while reducing network parameters by 87.84% compared to SPA-GPT.
KW - Side-channel analysis
KW - deep Q-network
KW - long short-term memory network
KW - simulated annealing
UR - https://www.scopus.com/pages/publications/105027947755
U2 - 10.1109/TIFS.2026.3654798
DO - 10.1109/TIFS.2026.3654798
M3 - Article
AN - SCOPUS:105027947755
SN - 1556-6013
VL - 21
SP - 1241
EP - 1256
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
ER -