Coordinate Blinding over Large Prime Fields

13 years 4 months ago

Download www.cs.bris.ac.uk

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

Michael Tunstall, Marc Joye

Real-time Traffic

CHES 2010 | Countermeasure | Cryptology | Multiplicative Blinding Scheme | Random Curve |

claim paper

» Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations

» Construction of Secure Random Curves of Genus 2 over Prime Fields

» The Function Field Sieve in the Medium Prime Case

» A Subexponential Algorithm for Discrete Logarithms over All Finite Fields

» Fast algorithms for computing isogenies between elliptic curves

» Detecting Rational Points on Hypersurfaces over Finite Fields

» The 2Adic CM Method for Genus 2 Curves with Application to Cryptography

» On the Minimal Embedding Field

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	CHES
Authors	Michael Tunstall, Marc Joye

Comments (0)

Sciweavers

Coordinate Blinding over Large Prime Fields

CHES 2010 | Countermeasure | Cryptology | Multiplicative Blinding Scheme | Random Curve |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers