Cryptology ePrint Archive: Report 2005/113

Partially Fixed Point Multiplication

Majid Khabbazian, T. Aaron Gulliver and Vijay K. Bhargava

Abstract: A new technique is proposed in which bandwidth and memory are together used to reduce both the number of point additions and doublings required in computing random point multiplication. Using the proposed technique, we show that a significant speed-up can be obtained at the cost of slightly increased bandwidth. In addition, we show that the proposed technique is well-suited for parallel processing.

Category / Keywords: public-key cryptography / cryptography, elliptic curves, point multiplication, fast computation, parallel processing

Date: received 8 Apr 2005

Contact author: majidk at ece ubc ca

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050415:035412 (All versions of this report)

Discussion forum: Show discussion | Start new discussion