Online Template Attacks [chapter]

Lejla Batina, Łukasz Chmielewski, Louiza Papachristodoulou, Peter Schwabe, Michael Tunstall
2014 Lecture Notes in Computer Science  
In the context of attacking elliptic-curve scalar multiplication with template attacks, one can interleave template generation and template matching to reduce the amount of template traces. This paper enhances the power of this technique by defining and applying the concept of online template attacks (OTA); a general attack technique with minimal assumptions for an attacker, who has very limited control over the target device. We show that OTA need only one power consumption trace of a scalar
more » ... ltiplication on the target device; they are thus suitable not only against ECDSA and static Diffie-Hellman, but also against elliptic-curve scalar multiplication in ephemeral Diffie-Hellman. In addition, OTA need only one template trace per scalar bit and they can be applied to almost all scalar-multiplication algorithms. To demonstrate the power of OTA we recover scalar bits of a scalar multiplication using the double-and-add-always algorithm on a twisted Edwards curve running on a smart card with an ATmega163 CPU.
doi:10.1007/978-3-319-13039-2_2 fatcat:ehl5e57csjfiblhxli5xzofvuu