New formulae for efficient elliptic curve arithmetic

Authors:
Huseyin Hisil;Gary Carter;Ed Dawson
Affiliations:
Information Security Institute, Queensland University of Technology;Information Security Institute, Queensland University of Technology;Information Security Institute, Queensland University of Technology
Venue:
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Year:
2007

Citing 9
Cited 13

Improving the arithmetic of elliptic curves in the Jacobi model

Information Processing Letters
The Jacobi model of an elliptic curve and side-channel analysis

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Optimizing double-base elliptic-curve single-scalar multiplication

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Faster addition and doubling on elliptic curves

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Extending scalar multiplication using double bases

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Extended double-base number system with applications to elliptic curve cryptography

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient and secure elliptic curve point multiplication using double-base chains

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Scalar multiplication on elliptic curves defined over fields of small odd characteristic

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Efficient scalar multiplication by isogeny decompositions

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

Jacobi Quartic Curves Revisited

ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Elliptic Curve Scalar Multiplication Combining Yao's Algorithm and Double Bases

CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Optimizing double-base elliptic-curve single-scalar multiplication

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Inverted edwards coordinates

AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Twisted Edwards curves

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
Faster group operations on elliptic curves

AISC '09 Proceedings of the Seventh Australasian Conference on Information Security - Volume 98
Toric forms of elliptic curves and their arithmetic

Journal of Symbolic Computation
Hashing into Hessian curves

AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Efficient pairing computation on Elliptic curves in Hessian form

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Twisted jacobi intersections curves

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Efficient arithmetic on hessian curves

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fast tate pairing computation on twisted Jacobi intersections curves

Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
Twisted Jacobi intersections curves

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper is on efficient implementation techniques of Elliptic Curve Cryptography. In particular, we improve timings for Jacobiquartic (3M+4S) and Hessian (7M+1S or 3M+6S) doubling operations. We provide a faster mixed-addition (7M+3S+1d) on modified Jacobiquartic coordinates. We introduce tripling formulae for Jacobi-quartic (4M+11S+2d), Jacobi-intersection (4M+10S+5d or 7M+7S+3d), Edwards (9M+4S) and Hessian (8M+6S+1d) forms. We show that Hessian tripling costs 6M+4C+1d for Hessian curves defined over a field of characteristic 3. We discuss an alternative way of choosing the base point in successive squaring based scalar multiplication algorithms. Using this technique, we improve the latest mixed-addition formulae for Jacobi-intersection (10M+2S+1d), Hessian (5M+6S) and Edwards (9M+1S+ 1d+4a) forms. We discuss the significance of these optimizations for elliptic curve cryptography.