Coordinate Blinding over Large Prime Fields

  • Michael Tunstall
  • Marc Joye
Conference paper

DOI: 10.1007/978-3-642-15031-9_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6225)
Cite this paper as:
Tunstall M., Joye M. (2010) Coordinate Blinding over Large Prime Fields. In: Mangard S., Standaert FX. (eds) Cryptographic Hardware and Embedded Systems, CHES 2010. CHES 2010. Lecture Notes in Computer Science, vol 6225. Springer, Berlin, Heidelberg


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.


Elliptic curve cryptography side-channel analysis countermeasures 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Michael Tunstall
    • 1
  • Marc Joye
    • 2
  1. 1.Department of Computer ScienceUniversity of BristolBristolUnited Kingdom
  2. 2.Technicolor, Security & Content Protection LabsCesson-Sévigné CedexFrance

Personalised recommendations