SCALAR MULTIPLICATION ON GENERALIZED HUFF CURVES USING THE SKEW-FROBENIUS MAP
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
This paper presents the Frobenius endomorphism on generalized Huff curve and provides the characteristic polynomial of the map. By applying the Frobenius endomorphism on generalized Huff curve, we construct a skew-Frobenius map defined on the quadratic twist of a generalized Huff curve. This map offers an efficiently computable homomorphism for performing scalar multiplication on the generalized Huff curve over a finite field. As an application, we describe the GLV method combined with the Frobenius endomorphism over the curve to speed up the scalar multiplication.
Abstract
This paper presents the Frobenius endomorphism on generalized Huff curve and provides the characteristic polynomial of the map. By applying the Frobenius endomorphism on generalized Huff curve, we construct a skew-Frobenius map defined on the quadratic twist of a generalized Huff curve. This map offers an efficiently computable homomorphism for performing scalar multiplication on the generalized Huff curve over a finite field. As an application, we describe the GLV method combined with the Frobenius endomorphism over the curve to speed up the scalar multiplication.
참고문헌 (12)
- R. Avanzi, "Handbook of Elliptic and Hyperelliptic Cryptography", pp.2006, Chapman and Hall
- T. Iijima, "Construction of Frobenius Maps of Twists Elliptic Curves and its Application to Elliptic Scalar Multiplication", SCIS 2002, pp.699~702 (2002), IEICE Japan
- R. P. Gallant, "CRYPTO 2001", pp.190~200 (2001), Springer
- S. D. Galbraith, "Endomorphisms for faster elliptic curve cryptography on a large class of curves", J. Cryptology, 24(3), pp.446~469 (2011)
- J. Guajardo, "Itoh-tusji version in standard basis and its applicaiton in cryptography and codes", Design, Codes and Cryptography, 25(2), pp.207~216 (2002)
- G. B. Huff, "Diophantine problems in geometry and elliptic ternary forms", Duke Math. J, 15, pp.443~453 (1948)
- M. Joye, "Huff’s Model for Elliptic Curves, Algorithmic Number Theory - ANTS-IX", pp.234~250 (2010), Springer
- N. Koblitz, "Elliptic curve cryptosystems", Math. Comp, 48, pp.203~209 (1987)
- V. S. Miller, "Advances in Cryptology-CRYPTO’85", pp.417~426 (1986)
- "Elliptic curves in Huff’s model" (2010)[URL]
- D. Yong, "High speed modular divider based on GCD algorithm over GF(2m)", Journal of communications, 29(10), pp.199~204 (2008)