Efficient representations on Koblitz curves with resistance to side channel attacks

16Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Koblitz curves belong to a special class of binary curves on which the scalar multiplication can be computed very efficiently. For this reason, they are suitable candidates for implementations on low-end processors. However, such devices are often vulnerable to side channel attacks. In this paper, we propose two countermeasures against side channel attacks on Koblitz curves. Both of them utilize a fixed-pattern receding to defeat simple power analysis. Our first technique extends a known countermeasure to the special case of Koblitz curves. In our second technique, the scalar is recoded from left to right, and can be easily stored or even randomly generated. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Okeya, K., Takagi, T., & Vuillaume, C. (2005). Efficient representations on Koblitz curves with resistance to side channel attacks. In Lecture Notes in Computer Science (Vol. 3574, pp. 218–229). Springer Verlag. https://doi.org/10.1007/11506157_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free