author        = {Nashwa A. F. Mohammed and Mohsin H. A. Hashim and Michael Hutter},
  title         = {Improved Fixed-base Comb Method for Fast Scalar Multiplication},
  booktitle     = {International Conference on Cryptology in Africa -- AFRICACRYPT 2012, 5th Edition, Ifrance, Morocco, July 10-12},
  year          = {2012},
  editor        = {Aikaterini Mitrokotsa and Serge Vaudenay},
  volume        = {7374},
  pages         = {342--359},
  ee            = {http://dx.doi.org/10.1007/978-3-642-31410-0_21},
  publisher     = {Springer Berlin Heidelberg},
  doi           = {10.1007/978-3-642-31410-0_21},  
  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-w non-adjacent form representation and restrict the number of rows of the comb to be greater or equal w. 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.}