A side-channel attack on a masked and shuffled software implementation of Saber
Open Access
- 25 April 2023
- journal article
- research article
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 13 (4) , 443-460
Abstract
In this paper, we show that a software implementation of IND-CCA-secure Saber key encapsulation mechanism protected by first-order masking and shuffling can be broken by deep learning-based power analysis. Using an ensemble of deep neural networks trained at the profiling stage, we can recover the session key and the secret key from $$257 \times N$$ and $$24 \times 257 \times N$$ traces, respectively, where N is the number of repetitions of the same measurement. The value of N depends on the implementation of the algorithm, the type of device under attack, environmental factors, acquisition noise, etc.; in our experiments $$N = 10$$ is sufficient for a successful attack. The neural networks are trained on a combination of 80% of traces from the profiling device with a known shuffling order and 20% of traces from the device under attack captured for all-0 and all-1 messages. “Spicing” the training set with traces from the device under attack helps us minimize the negative effect of inter-device variability.
Keywords
Funding Information
- Myndigheten för Samhällsskydd och Beredskap (2020-11632)
- Vetenskapsrådet (2018-04482, 2019-04166)
- Stiftelsen för Strategisk Forskning (RIT17-0005)
This publication has 52 references indexed in Scilit:
- Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note2012
- Secure Integration of Asymmetric and Symmetric Encryption SchemesJournal of Cryptology, 2011
- Consecutive S-box Lookups: A Timing Attack on SNOW 3G2010
- An Efficient Method for Random Delay Generation in Embedded Software2009
- The EM Side—Channel(s)2003
- Towards Sound Approaches to Counteract Power-Analysis Attacks1999
- Differential Power Analysis1999
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- Algorithm 235: Random permutationCommunications of the ACM, 1964
- THE GENERALIZATION OF ‘STUDENT'S’ PROBLEM WHEN SEVERAL DIFFERENT POPULATION VARLANCES ARE INVOLVEDBiometrika, 1947