Paper 2013/504

A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves

Reza Azarderakhsh and Koray Karabina

Abstract

Efficient implementation of double point multiplication is crucial for elliptic curve cryptographic systems. We revisit three recently proposed simultaneous double point multiplication algorithms. We propose hardware architectures for these algorithms, and provide a comparative analysis of their performance. We implement the proposed architectures on Xilinx Virtex-4 FPGA, and report on the area and time results . Our results indicate that differential addition chain based algorithms are better suited to compute double point multiplication over binary elliptic curves for both high performance and resource constrained applications.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Contact author(s)
razarder @ math uwaterloo ca
History
2013-08-17: received
Short URL
https://ia.cr/2013/504
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/504,
      author = {Reza Azarderakhsh and Koray Karabina},
      title = {A Comparison of Double Point Multiplication Algorithms and their Implementation over Binary Elliptic Curves},
      howpublished = {Cryptology ePrint Archive, Paper 2013/504},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/504}},
      url = {https://eprint.iacr.org/2013/504}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.