Jiahui Liu^1,2, Lang Li^1,2,*, Di Li^1,2, Yu Ou^1,2

CMC-Computers, Materials & Continua, Vol.79, No.3, pp. 4641-4657, 2024, DOI:10.32604/cmc.2024.051613

Abstract Correlation power analysis (CPA) combined with genetic algorithms (GA) now achieves greater attack efficiency and can recover all subkeys simultaneously. However, two issues in GA-based CPA still need to be addressed: key degeneration and slow evolution within populations. These challenges significantly hinder key recovery efforts. This paper proposes a screening correlation power analysis framework combined with a genetic algorithm, named SFGA-CPA, to address these issues. SFGA-CPA introduces three operations designed to exploit CPA characteristics: propagative operation, constrained crossover, and constrained mutation. Firstly, the propagative operation accelerates population evolution by maximizing the number of correct bytes… More >

Yuyuan Li^1,2, Lang Li^1,2,*, Yu Ou^1,2

CMC-Computers, Materials & Continua, Vol.79, No.1, pp. 1245-1262, 2024, DOI:10.32604/cmc.2024.049882

Abstract The Inner Product Masking (IPM) scheme has been shown to provide higher theoretical security guarantees than the Boolean Masking (BM). This scheme aims to increase the algebraic complexity of the coding to achieve a higher level of security. Some previous work unfolds when certain (adversarial and implementation) conditions are met, and we seek to complement these investigations by understanding what happens when these conditions deviate from their expected behaviour. In this paper, we investigate the security characteristics of IPM under different conditions. In adversarial condition, the security properties of first-order IPMs obtained through parametric characterization More >