Browse Prior Art Database

An Elliptic Curve Scalar Multiplication Algorithm Resistant to Simple Power Analysis

IP.com Disclosure Number: IPCOM000006768D
Original Publication Date: 2002-Jan-30
Included in the Prior Art Database: 2002-Jan-30

Publishing Venue

Motorola

Related People

Authors:
Paul Montague Yvonne Hitchcock

Related Documents

Other References:
CHES 1999, Volume 1717 - OTHER Cambridge University Press, 1999 - OTHER ISC 2001, Volume 2200 - OTHER [+details]

Abstract

Elliptic curve cryptography is rapidly becoming the public key cryptographic algorithm of choice for a variety of portable/embedded devices, such as PDAs, mobile phones, smart cards, etc, because of the reduced number of key bits required in comparison to other cryptosystems. However, this class of devices is uniquely susceptible to so-called side-channel attacks, aimed at discovering information about the users private key by monitoring of e.g. power consumption during a computation using this key. The problem then is to render such attacks either infeasible or impractical by an appropriate choice of algorithm and/or implementation of the private key computation in the device. We present an algorithm for elliptic curve scalar multiplication using a reformatted scalar. Our solution is shown to be more efficient than those previously proposed in the literature (either in terms of the impact on the computational time due to addition of the defences or on the memory requirements).