International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Partially Fixed Point Multiplication

Authors:
Majid Khabbazian
T. Aaron Gulliver
Vijay K. Bhargava
Download:
URL: http://eprint.iacr.org/2005/113
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12449,
  title={Partially Fixed Point Multiplication},
  booktitle={IACR Eprint archive},
  keywords={public-key cryptography / cryptography, elliptic curves, point multiplication, fast computation, parallel processing},
  url={http://eprint.iacr.org/2005/113},
  note={ majidk@ece.ubc.ca 12882 received 8 Apr 2005},
  author={Majid Khabbazian and T. Aaron Gulliver and Vijay K. Bhargava},
  year=2005
}