Efficient and secure elliptic curve point multiplication using double-base chains

  • Authors:
  • Vassil Dimitrov;Laurent Imbert;Pradeep Kumar Mishra

  • Affiliations:
  • Advanced Technology Information Processing Systems laboratory, University of Calgary, Canada;Advanced Technology Information Processing Systems laboratory, University of Calgary, Canada;Centre for Informations Security and Cryptography, University of Calgary, Canada

  • Venue:
  • ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a efficient and secure point multiplication algorithm, based on double-base chains. This is achieved by taking advantage of the sparseness and the ternary nature of the so-called double-base number system (DBNS). The speed-ups are the results of fewer point additions and improved formulæ for point triplings and quadruplings in both even and odd characteristic. Our algorithms can be protected against simple and differential side-channel analysis by using side-channel atomicity and classical randomization techniques. Our numerical experiments show that our approach leads to speed-ups compared to windowing methods, even with window size equal to 4, and other SCA resistant algorithms.