Cryptology ePrint Archive: Report 2015/1060

Complete addition formulas for prime order elliptic curves

Joost Renes and Craig Costello and Lejla Batina

Abstract: An elliptic curve addition law is said to be complete if it correctly computes the sum of any two points in the elliptic curve group. One of the main reasons for the increased popularity of Edwards curves in the ECC community is that they can allow a complete group law that is also relatively efficient (e.g., when compared to all known addition laws on Edwards curves). Such complete addition formulas can simplify the task of an ECC implementer and, at the same time, can greatly reduce the potential vulnerabilities of a cryptosystem. Unfortunately, until now, complete addition laws that are relatively efficient have only been proposed on curves of composite order and have thus been incompatible with all of the currently standardized prime order curves.

In this paper we present optimized addition formulas that are complete on every prime order short Weierstrass curve defined over a field k with char(k) not 2 or 3. Compared to their incomplete counterparts, these formulas require a larger number of field additions, but interestingly require fewer field multiplications. We discuss how these formulas can be used to achieve secure, exception-free implementations on all of the prime order curves in the NIST (and many other) standards.

Category / Keywords: public-key cryptography / public-key cryptography, elliptic curves, short Weierstrass form, complete addition formulas

Original Publication (in the same form): IACR-EUROCRYPT-2016

Date: received 30 Oct 2015, last revised 8 Mar 2016

Contact author: j renes at cs ru nl

Available format(s): PDF | BibTeX Citation

Note: EUROCRYPT 2016 camera-ready version

Version: 20160308:084043 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]