Coordinate blinding over large prime fields

9Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies to elliptic curves in the short Weierstraß form over large prime fields. The described countermeasure is shown to be a generalization of the use of random curve isomorphisms to prevent side-channel analysis, and our best configuration of this countermeasure is shown to be equivalent to the use of random curve isomorphisms. Furthermore, we describe how this countermeasure, and therefore random curve isomorphisms, can be efficiently implemented using Montgomery multiplication. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tunstall, M., & Joye, M. (2010). Coordinate blinding over large prime fields. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6225 LNCS, pp. 443–455). Springer Verlag. https://doi.org/10.1007/978-3-642-15031-9_30

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