Faster Point Scalar Multiplication on Short Weierstrass Elliptic Curves over Fp using Twisted Hessian Curves over Fp2

Authors

DOI:

https://doi.org/10.26636/jtit.2016.3.753

Keywords:

elliptic curve cryptography, hardware implementation, twisted Hessian curves

Abstract

This article shows how to use fast Fp2 arithmetic and twisted Hessian curves to obtain faster point scalar multiplication on elliptic curve ESW in short Weierstrass form over Fp. It is assumed that p and #ESW(Fp) are different large primes, #E(Fq) denotes number of points on curve E over field Fq and #EtSW (Fp), where Et is twist of E, is divisible by 3. For example this method is suitable for two NIST curves over Fp: NIST P-224 and NIST P-256. The presented solution may be much faster than classic approach. Presented solution should also be resistant for side channel attacks and information about Y coordinate should not be lost (using for example Brier-Joye ladder such information may be lost). If coefficient A in equation of curve ESW : y² = x³ + Ax + B in short Weierstrass curve is not of special form, presented solution is up to 30% faster than classic approach. If A = −3, proposed method may be up to 24% faster.

Downloads

Download data is not yet available.

References

[1] E. Brier and M. Joye, “Weierstraß elliptic curves and side-channel attacks”, in Public Key Cryptography, LNCS, vol. 2274, pp. 335–345. Springer, 2002 (doi: 10.1007/3-540-45664-3_24).
View in Google Scholar

[2] S. Ghosh, D. Mukhopadhyay, and D. Roychowdhury, “High speed flexible pairing cryptoprocessor on FPGA platform”, in Pairing-Based Cryptography – Pairing 2010, S. Ghosh, D. Mukhopadhyay, and D. Roychowdhury, Eds. LNCS, vol. 6487, pp. 450–466. Springer, 2010 (doi: 10.1007/978-3-642-17455-1_28).
View in Google Scholar

[3] H. Cohen and G. Frey, Handbook of Elliptic and Hyperelliptic Curve Cryptography. New York: Chapman & Hall/CRC, 2006.
View in Google Scholar

[4] J. Renes, C. Costello, and L. Batina, “Complete addition formulas for prime order elliptic curves”, Cryptology ePrint Archive, Report 2015/1060, 2015 [Online]. Available: https://eprint.iacr.org/2015/1060
View in Google Scholar

[5] Explicit Formulas Database [Online]. Available: http://hyperelliptic.org/EFD/g1p/index.html
View in Google Scholar

[6] D. Bernstein, Ch. Chuengsatiansup, D. Kohel, and T. Lange, “Twisted Hessian curves”, Cryptology ePrint Archive, Report 2015/781, 2015 [Online]. Available: https://eprint.iacr.org/2015/781
View in Google Scholar

[7] N. P. Smart, “The Hessian form of an elliptic curve”, in Cryptographic Hardware and Embedded Systems – CHES 2001, LNCS, vol. 2162, pp. 118–125. Springer, 2001 (doi: 10.1007/3-540-44709-1_11).
View in Google Scholar

[8] “Recommended Elliptic Curves for Federal Government Use”, National Institute of Standards and Technology, MD, USA, 1999 [Online]. Available: http://csrc.nist.gov/groups/ST/toolkit/documents/dss/NISTReCur.pdf
View in Google Scholar

[9] S. Galbraith, X. Lin, and M. Scott, “Endomorphisms for faster elliptic curve cryptography on a large class of curves”, J. of Cryptol., vol. 24, no. 3, pp. 446–469, 2011.
View in Google Scholar

Downloads

Published

2016-09-30

Issue

Section

RESEARCH ARTICLES

How to Cite

[1]
M. Wroński, “Faster Point Scalar Multiplication on Short Weierstrass Elliptic Curves over Fp using Twisted Hessian Curves over Fp2”, JTIT, vol. 65, no. 3, pp. 98–102, Sep. 2016, doi: 10.26636/jtit.2016.3.753.

Most read articles by the same author(s)