Cryptology ePrint Archive: Report 2015/1114

Faster arithmetic on elliptic curves using Fp2. Application to GLV-GLS and NIST elliptic curves over Fp isomorphic to twisted Hessian curves over fields extension

Michał Wroński

Abstract: In this article we present how we can use fast F_{pē} multiplication to speed-up arithmetic on elliptic curves. We use parallel computations for multiplication in F_{pē} which is not much slower than multiplication in F_{p}. We show two applications of this method. In the first we show that using twisted Edwards curves over F_{pē} with fast computable endomorphism (GLV-GLS method) may be nowadays on of the fastest (or even the fastest) solution in hardware applications. In the second we show how we can speed-up point scalar multiplication on NIST P-224 and NIST P-256 curves. We use field extension (F_{pē}) to find isomorphic to these curves twisted Hessian curves over F_{pē}. Our solution is faster than classic solutions up to 28.5% for NIST P-256 and up to 27.2% for NIST P-224 if we consider solution invulnerable for side channel attacks. We can also use different formula for point doubling and points addition and then our solution is faster up to 21.4% for NIST P-256 and up to 19.9% for NIST P-224 comparing to classic solutions.

Category / Keywords: applications / Field extension, twisted Hessian curves, GLV-GLS, twisted Edwards curves, point scalar multiplication

Date: received 16 Nov 2015

Contact author: mwronski at wat edu pl

Available format(s): PDF | BibTeX Citation

Version: 20151118:083405 (All versions of this report)

Short URL: ia.cr/2015/1114

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]