Paper 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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- cryptographyelliptic curvespoint multiplicationfast computationparallel processing
- Contact author(s)
- majidk @ ece ubc ca
- History
- 2005-04-15: received
- Short URL
- https://ia.cr/2005/113
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/113,
author = {Majid Khabbazian and T. Aaron Gulliver and Vijay K. Bhargava},
title = {Partially Fixed Point Multiplication},
howpublished = {Cryptology ePrint Archive, Paper 2005/113},
year = {2005},
note = {\url{https://eprint.iacr.org/2005/113}},
url = {https://eprint.iacr.org/2005/113}
}
