Ways to Enhance Differential Power Analysis

Bevan, Régis; Knudsen, Erik Woodward

doi:10.1007/3-540-36552-4_23

Cited by 56 publications

(64 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Both approaches exhibit some limitations due to unrealistic assumptions and model imperfections that will be examined more thoroughly in this paper. This work follows previous studies aiming at either improving the Hamming weight model [2], or enhancing the DPA itself by various means [6,4].…”

Section: Introductionmentioning

confidence: 89%

Correlation Power Analysis with a Leakage Model

Brier¹,

Clavier²,

Olivier³

2004

Lecture Notes in Computer Science

1,790

1,189

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 89%

Correlation Power Analysis with a Leakage Model

Brier¹,

Clavier²,

Olivier³

2004

Lecture Notes in Computer Science

1,790

1,189

View full text Add to dashboard Cite

show abstract

“…Here, we propose another approach to extend the initial single-bit attack to a multi-bit one. This exactly corresponds to the proposal made by Bévan and Knudsen in [1], and consists in summing the absolute values of ∆ K,K (j, β) for several indices j. It has been proved that this kind of multi-bit DPA attack is not reducible to a CPA attack and is actually a valuable alternative in practice [10].…”

Section: Redefining To: Where To Take the Absolute Valuesmentioning

confidence: 54%

“…In [10], it has been proved that this attack is equivalent to the so-called CPA attack introduced in [4] up to a change of the attacker model 5 . In [1], it has been proposed to add the absolute values of the D K,j (instead of the values themselves) to build D K . This approach may be a valuable alternative in practice and it is not equivalent to a CPA [10].…”

Section: Basics On Dpa Attacksmentioning

confidence: 99%

See 1 more Smart Citation

Redefining the transparency order

Chakraborty

Sarkar²,

Maitra

et al. 2016

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Abstract. In this paper, we consider the multi-bit Differential Power Analysis (DPA) in the Hamming weight model. In this regard, we revisit the definition of Transparency Order (TO) from the work of Prouff (FSE 2005) and find that the definition has certain limitations. Although this work has been quite well referred in the literature, surprisingly, these limitations remained unexplored for almost a decade. We analyse the definition from scratch, modify it and finally provide a definition with better insight that can theoretically capture DPA in Hamming weight model for hardware implementation with precharge logic. At the end, we confront the notion of (revised) transparency order with attack simulations in order to study to what extent the low transparency order of an s-box impacts the efficiency of a side channel attack against its processing. To the best of our knowledge, this is the first time that such a critical analysis is conducted (even considering the original notion of Prouff). It practically confirms that the transparency order is indeed related to the resistance of the s-box against side-channel attacks, but it also shows that it is not sufficient alone to directly achieve a satisfying level of security. Regarding this point, our conclusion is that the (revised) transparency order is a valuable criterion to consider when designing a cryptographic algorithm, and even if it does not preclude to also use classical countermeasures like masking or shuffling, it enables to improve their effectiveness.

show abstract

“…Messerges et al were the first to apply these techniques to public key implementations [21]. Later on, original DSCA has been improved by more efficient techniques such as the one based on the likelihood test proposed by Bevan et al [4], the Correlation Power Analysis (CPA) introduced by Brier et al [5], and more recent techniques like the Mutual Information Analysis (MIA) [14,24,25]. A common principle of all these techniques is that they require many power consumption or electromagnetic radiation curves to recover the secret manipulated.…”

Section: Introductionmentioning

confidence: 99%

Horizontal Correlation Analysis on Exponentiation

Clavier

Feix

Gagnerot

et al. 2010

Lecture Notes in Computer Science

131

115

View full text Add to dashboard Cite

Abstract. We introduce in this paper a technique in which we apply correlation analysis using only one execution power curve during an exponentiation to recover the whole secret exponent manipulated by the chip. As in the Big Mac attack from Walter, longer keys may facilitate this analysis and success will depend on the arithmetic coprocessor characteristics. We present the theory of the attack with some practical successful results on an embedded device and analyze the efficiency of classical countermeasures with respect to our attack. Our technique, which uses a single exponentiation curve, cannot be prevented by exponent blinding. Also, contrarily to the Big Mac attack, it applies even in the case of regular implementations such as the square and multiply always or the Montgomery ladder. We also point out that DSA and Diffie-Hellman exponentiations are no longer immune against CPA. Then we discuss the efficiency of known countermeasures, and we finally present some new ones.

show abstract

Ways to Enhance Differential Power Analysis

Cited by 56 publications

References 8 publications

Correlation Power Analysis with a Leakage Model

Correlation Power Analysis with a Leakage Model

Redefining the transparency order

Horizontal Correlation Analysis on Exponentiation

Contact Info

Product

Resources

About