Securing RSA against power analysis attacks through non‐uniform exponent partitioning with randomisation

Mahanta, Hridoy Jyoti; Khan, Ajoy Kumar

doi:10.1049/iet-ifs.2016.0508

Cited by 9 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we hope that our work will be followed by some interesting further research works. Among them, experiments should be performed on protected implementation and on different machine architectures [27][28][29][30][31]. The principal component analysis (PCA) could also be used to enhance our strategies [32].…”

Section: Resultsmentioning

confidence: 99%

Chosen message strategy to improve the correlation power analysis

Ouladj

Guillot

Mokrane

2019

IET Information Security

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

Chosen message strategy to improve the correlation power analysis

Ouladj

Guillot

Mokrane

2019

IET Information Security

View full text Add to dashboard Cite

“…To prevent these attacks, hardware protections and software countermeasures have been published, and the exponent and message blinding methods are the main countermeasures. In the exponent blinding method [20][21][22], the exponent is randomized or split, and consequently, subsequent exponentiation operations handle different exponential data. For message blinding methods [23][24][25], the message is multiplied by a random value, and this blinded message is then used in exponentiation algorithms.…”

Section: Related Workmentioning

confidence: 99%

“…The exponent blinding method and the message blinding method can also be regarded as effective countermeasures for modular exponentiation algorithms. There are generally two type exponent blinding countermeasures in present [20][21][22][23][24][25]. Ha et al [24] proposed a modular exponentiation protection method for double masking by using a random number r to blind the message and the exponent split.…”

Section: Exponent and Message Blinding Modular Exponentiation Algorithmmentioning

confidence: 99%

Clustering Collision Power Attack on RSA-CRT

Wan¹,

Chen²,

Xia³

et al. 2021

Computer Systems Science and Engineering

View full text Add to dashboard Cite

In this paper, we propose two new attack algorithms on RSA implementations with CRT (Chinese remainder theorem). To improve the attack efficiency considerably, a clustering collision power attack on RSA with CRT is introduced via chosen-message pairs. This attack method is that the key parameters d p and d q are segmented by byte, and the modular multiplication collisions are identified by k-means clustering. The exponents d p and d q were recovered by 12 power traces of six groups of the specific message pairs, and the exponent d was obtained. We also propose a second order clustering collision power analysis attack against RSA implementation with CRT, which applies double blinding exponentiation. To reduce noise and artificial participation, we analyze the power points of interest by preprocessing and k-means clustering with horizontal correlation collisions. Thus, we recovered approximately 91% of the secret exponents manipulated with a single power curve on RSA-CRT with countermeasures of double blinding methods.

show abstract