TY - JOUR
T1 - A UMAP-Based Clustering Side-Channel Analysis on Public-Key Cryptosystems
AU - Qian, Yuhan
AU - Ding, Yaoling
AU - Sun, Shaofei
AU - Wei, Congming
AU - Wang, An
AU - Zhu, Liehuang
N1 - Publisher Copyright:
© 1982-2012 IEEE.
PY - 2026/4/1
Y1 - 2026/4/1
N2 - Horizontal analysis is a widely adopted method in side-channel analysis, particularly for public-key cryptosystems (PKCs), where attackers aim to recover the key from a single trace. Current methods rely on trace segmentation, dimensionality reduction, and classification, but high noise and poor feature preservation hinder accuracy. Noise blurs cryptographic operation segment boundaries, and existing dimensionality reduction techniques fail to maintain the inherent distribution of trace points in a high-dimensional space. As a result, secret information recovery based on clustering remains inaccurate. This article proposes an automated horizontal analysis framework named uniform manifold approximation and projection (UMAP)-HC to improve secret information recovery accuracy. The framework uses a sliding segmentation method to locate cryptographic operations in noisy traces with blurred segment boundaries. It leverages UMAP for feature preservation and hierarchical clustering for secret information recovery. Experimental results on four open access public-key algorithm power trace datasets, an SM2 power trace collected from a smart card, and an ECC power trace with dummy operation countermeasures demonstrate that UMAP-HC effectively classifies cryptographic operations, accurately locates operation segments, and recovers secret key. It achieves up to 100% recovery accuracy, surpassing previous methods by 40%-70%, with normalized mutual information (NMI) reaching 1, an improvement of 0.02-0.99 over existing approaches.
AB - Horizontal analysis is a widely adopted method in side-channel analysis, particularly for public-key cryptosystems (PKCs), where attackers aim to recover the key from a single trace. Current methods rely on trace segmentation, dimensionality reduction, and classification, but high noise and poor feature preservation hinder accuracy. Noise blurs cryptographic operation segment boundaries, and existing dimensionality reduction techniques fail to maintain the inherent distribution of trace points in a high-dimensional space. As a result, secret information recovery based on clustering remains inaccurate. This article proposes an automated horizontal analysis framework named uniform manifold approximation and projection (UMAP)-HC to improve secret information recovery accuracy. The framework uses a sliding segmentation method to locate cryptographic operations in noisy traces with blurred segment boundaries. It leverages UMAP for feature preservation and hierarchical clustering for secret information recovery. Experimental results on four open access public-key algorithm power trace datasets, an SM2 power trace collected from a smart card, and an ECC power trace with dummy operation countermeasures demonstrate that UMAP-HC effectively classifies cryptographic operations, accurately locates operation segments, and recovers secret key. It achieves up to 100% recovery accuracy, surpassing previous methods by 40%-70%, with normalized mutual information (NMI) reaching 1, an improvement of 0.02-0.99 over existing approaches.
KW - Horizontal analysis
KW - public-key cryptosystems (PKCs)
KW - side-channel analysis
KW - trace segmentation
KW - uniform manifold approximation and projection (UMAP)
UR - https://www.scopus.com/pages/publications/105015084443
U2 - 10.1109/TCAD.2025.3604641
DO - 10.1109/TCAD.2025.3604641
M3 - Article
AN - SCOPUS:105015084443
SN - 0278-0070
VL - 45
SP - 2014
EP - 2027
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IS - 4
ER -