Cryptology ePrint Archive: Report 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.

Category / Keywords: implementation /

Date: received 15 Aug 2013

Contact author: razarder at math uwaterloo ca

Available format(s): PDF | BibTeX Citation

Version: 20130817:204536 (All versions of this report)

Short URL: ia.cr/2013/504

Discussion forum: Show discussion | Start new discussion