In this paper we present a new approach to attacking a modular exponentiation and scalar multiplication based by distinguishing multiplications from squaring operations using the instantaneous power consumption. Previous approaches have been able to distinguish these operations based on information of the specific implementation of the embedded algorithm or the relationship between specific plaintexts. The proposed attack exploits the expected Hamming weight of the result of the computed operations. We extrapolate our observations and assess the consequences for elliptic curve cryptosystems when unified formulæ for point addition are used. © 2009 Springer.
CITATION STYLE
Amiel, F., Feix, B., Tunstall, M., Whelan, C., & Marnane, W. P. (2008). Distinguishing multiplications from squaring operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5381 LNCS, pp. 346–360). https://doi.org/10.1007/978-3-642-04159-4_22
Mendeley helps you to discover research relevant for your work.