Name
Abstract | ||
|---|---|---|
Computing elliptic-curve scalar multiplication is the most time consuming operation in any elliptic-curve cryptosystem. In the last decades, it has been shown that pre-computations of elliptic-curve points improve the performance of scalar multiplication especially in cases where the elliptic-curve point P is fixed. In this paper, we present an improved fixed-base comb method for scalar multiplication. In contrast to existing comb methods such as proposed by Lim and Lee or Tsaur and Chou, we make use of a width-ω non-adjacent form representation and restrict the number of rows of the comb to be greater or equal ω. The proposed method shows a significant reduction in the number of required elliptic-curve point addition operation. The computational complexity is reduced by 33 to 38,% compared to Tsaur and Chou method even for devices that have limited resources. Furthermore, we propose a constant-time variation of the method to thwart simple-power analysis attacks. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-31410-0_21 | AFRICACRYPT |
Keywords | Field | DocType |
chou method,required elliptic-curve point addition,scalar multiplication,elliptic-curve point,improved fixed-base comb method,elliptic-curve cryptosystem,fast scalar multiplication,computational complexity,time consuming operation,comb method | Row,Non-adjacent form,Scalar multiplication,Arithmetic,Elliptic curve cryptosystem,Cryptosystem,Elliptic curve point multiplication,Mathematics,Computational complexity theory | Conference |
Citations | PageRank | References |
6 | 0.49 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nashwa A. F. Mohamed | 1 | 9 | 0.94 |
| Mohsin H. A. Hashim | 2 | 6 | 0.49 |
| Michael Hutter | 3 | 345 | 25.26 |