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.
|Translated title of the contribution||Coordinate Blinding over Large Prime Fields|
|Title of host publication||Cryptographic Hardware and Embedded Systems - CHES 2010|
|Publisher||Springer Berlin Heidelberg|
|Publication status||Published - 2010|
Bibliographical noteOther page information: 443-455
Conference Proceedings/Title of Journal: Cryptographic Hardware and Embedded Systems - CHES 2010
Other identifier: 2001248