Improved Collision-Correlation Power Analysis on First Order Protected AES
VERNEUIL, Vincent
Inside Secure
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
< Reduce
Inside Secure
Lithe and fast algorithmic number theory [LFANT]
Institut de Mathématiques de Bordeaux [IMB]
Language
en
Communication dans un congrès
This item was published in
Workshop on Cryptographic Hardware and Embedded Systems - CHES 2011, 2011-09-28, Nara. 2011-09, vol. 6917, p. 49-62
Springer
English Abstract
The recent results presented by Moradi et al. on AES at CHES 2010 and Witteman et al. on square-and-multiply always RSA exponentiation at CT-RSA 2011 have shown that collision-correlation power analysis is able to recover ...Read more >
The recent results presented by Moradi et al. on AES at CHES 2010 and Witteman et al. on square-and-multiply always RSA exponentiation at CT-RSA 2011 have shown that collision-correlation power analysis is able to recover the secret keys on embedded implementations. However, we noticed that the attack published last year by Moradi et al. is not efficient on correctly first-order protected implementations. We propose in this paper improvements on collision-correlation attacks which require less power traces than classical second-order power analysis techniques. We present here two new methods and show in practice their real efficiency on two first-order protected AES implementations. We also mention that other symmetric embedded algorithms can be targeted by our new techniques.Read less <
English Keywords
AES
Side Channel Analysis
Collision
Correlation
DPA
Masking
Origin
Hal imported