An Automated End-to-End Side Channel Analysis Based on Probabilistic Model
Source abstract
Abstract
In this paper, we propose a new automated way to find out the secret exponent from a single power trace. We segment the power trace into subsignals that are directly related to recovery of the secret exponent. The proposed approach does not need the reference window to slide, templates nor correlation coefficients compared to previous manners. Our method detects change points in the power trace to explore the locations of the operations and is robust to unexpected noise addition. We first model the change point detection problem to catch the subsignals irrelevant to the secret and solve this problem with Markov Chain Monte Carlo (MCMC) which gives a global optimal solution. After separating the relevant and irrelevant parts in signal, we extract features from the segments and group segments into clusters to find the key exponent. Using single power trace indicates the weakest power level of attacker where there is a very slight chance of acquiring as many power traces as needed for breaking the key. We empirically show the improvement in accuracy even with presence of high level of noise.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptographic Implementations and Security · Digital Media Forensic Detection · Physical Unclonable Functions (PUFs) and Hardware Security
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Graduate School of Information Security, Korea University, Seoul 02841, Korea
References (27)
Show source-provided references
1. Messerges, T.S., Dabbish, E.A., and Sloan, R.H. (1999, January 12–13). Power analysis attacks of modular exponentiation in smartcards. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Worcester, MA, USA.10.1007/3-540-48059-5_14 ↗
2. Witteman, M.F., van Woudenberg, J.G., and Menarini, F. (2011, January 14–18). Defeating RSA multiply-always and message blinding countermeasures. Proceedings of the Cryptographers’ Track at the RSA Conference, San Francisco, CA, USA.10.1007/978-3-642-19074-2_6 ↗
3. Picek, S., Heuser, A., Jovic, A., Ludwig, S.A., Guilley, S., Jakobovic, D., and Mentens, N. (2017, January 14–19). Side-channel analysis and machine learning: A practical perspective. Proceedings of the 2017 International Joint Conference on Neural Networks (IJCNN), Anchorage, AK, USA.10.1109/IJCNN.2017.7966373 ↗
4. Power analysis attack: An approach based on machine learning10.1504/IJACT.2014.062722 ↗
5. Benadjila, R., Prouff, E., Strullu, R., Cagli, E., and Dumas, C. (2018). Study of deep learning techniques for side-channel analysis and introduction to ASCAD database. ANSSI, France & CEA, LETI, MINATEC Campus, France, Available online: https://eprint.iacr.org/2018/053.pdf.
6. Hettwer, B., Gehrer, S., and Güneysu, T. (2019). Applications of machine learning techniques in side-channel attacks: A survey. J. Cryptogr. Eng., 1–28.10.1007/s13389-019-00212-8 ↗
7. Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., and Verneuil, V. (2010, January 15–17). Horizontal correlation analysis on exponentiation. Proceedings of the International Conference on Information and Communications Security, Barcelona, Spain.10.1007/978-3-642-17650-0_5 ↗
8. Bauer, A., Jaulmes, E., Prouff, E., and Wild, J. (March, January 25). Horizontal and vertical side-channel attacks against secure RSA implementations. Proceedings of the Cryptographers’ Track at the RSA Conference, San Francisco, CA, USA.
9. Bauer, A., and Jaulmes, É. (2013, January 7–10). Correlation analysis against protected SFM implementations of RSA. Proceedings of the International Conference on Cryptology in India, Mumbai, India.10.1007/978-3-319-03515-4_7 ↗
10. Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., and Verneuil, V. (2012, January 9–12). ROSETTA for single trace analysis. Proceedings of the International Conference on Cryptology in India, Kolkata, India.10.1007/978-3-642-34931-7_9 ↗
11. Walter, C.D. (2001, January 14–16). Sliding windows succumbs to Big Mac attack. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Paris, France.10.1007/3-540-44709-1_24 ↗
12. Specht, R., Heyszl, J., Kleinsteuber, M., and Sigl, G. (2015, January 13–14). Improving non-profiled attacks on exponentiations based on clustering and extracting leakage from multi-channel high-resolution EM measurements. Proceedings of the International Workshop on Constructive Side-Channel Analysis and Secure Design, Berlin, Germany.10.1007/978-3-319-21476-4_1 ↗
13. Heyszl, J., Ibing, A., Mangard, S., De Santis, F., and Sigl, G. (2013, January 27–29). Clustering algorithms for non-profiled single-execution attacks on exponentiations. Proceedings of the International Conference on Smart Card Research and Advanced Applications, Berlin, Germany.10.1007/978-3-319-08302-5_6 ↗
14. Batina, L., Gierlichs, B., and Lemke-Rust, K. (2009, January 6–9). Differential cluster analysis. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Lausanne, Switzerland.10.1007/978-3-642-04138-9_9 ↗
15. Nascimento, E., and Chmielewski, Ł. (2017, January 13–15). Applying horizontal clustering side-channel attacks on embedded ECC implementations. Proceedings of the International Conference on Smart Card Research and Advanced Applications, Lugano, Switzerland.10.1007/978-3-319-75208-2_13 ↗
16. Perin, G., and Chmielewski, Ł. (2015, January 4–6). A semi-parametric approach for side-channel attacks on protected RSA implementations. Proceedings of the International Conference on Smart Card Research and Advanced Applications, Bochum, Germany.10.1007/978-3-319-31271-2_3 ↗
17. Least-squares estimation of an unknown number of shifts in a time series10.1111/1467-9892.00172 ↗
18. Reversible jump Markov chain Monte Carlo computation and Bayesian model determination10.1093/biomet/82.4.711 ↗
19. An application of MCMC methods for the multiple change-points problem10.1016/S0165-1684(00)00189-4 ↗
20. Bishop, C.M. (2006). Pattern Recognition and Machine Learning, Springer Science+ Business Media.
21. Equation of state calculations by fast computing machines10.1063/1.1699114 ↗
22. Hastings, W.K. (1970). Monte Carlo Sampling Methods Using Markov Chains and Their Applications, Oxford University Press.10.2307/2334940 ↗
23. Optimal segmentation of random processes10.1109/78.668798 ↗
24. Arthur, D., and Vassilvitskii, S. (2007, January 7–9). k-means++: The advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA.
25. A cluster separation measure10.1109/TPAMI.1979.4766909 ↗
26. Dassios, I.K., and Szajowski, K.J. (July, January 29). A non-autonomous stochastic discrete time system with uniform disturbances. Proceedings of the IFIP Conference on System Modeling and Optimization, Sophia Antipolis, France.
27. Bayesian optimal control for a non-autonomous stochastic discrete time system