Skip to Main content Skip to Navigation
Journal articles

Improving the Arithmetic of Elliptic Curves in the Jacobi Model

Abstract : The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is becoming crucial. Several techniques have recently been developed. One of these consists of finding a representation of the elliptic curve such that formulae for doubling and addition are the same. Until now, the best result has been obtained by using the Jacobi model. In this paper, we improve the arithmetic of elliptic curves in the Jacobi model and we relax some conditions required to work efficiently on this model. We thus obtained the fastest unified addition formulae for elliptic curve cryptography (assuming that the curve has a 2-torsion point)
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Sylvain Duquesne <>
Submitted on : Friday, May 11, 2007 - 4:02:01 PM
Last modification on : Thursday, May 24, 2018 - 3:59:20 PM
Long-term archiving on: : Wednesday, April 7, 2010 - 3:35:19 AM



Sylvain Duquesne. Improving the Arithmetic of Elliptic Curves in the Jacobi Model. Information Processing Letters, Elsevier, 2007, 0, pp.5. ⟨10.1016/j.ipl.2007.05.012⟩. ⟨lirmm-00145805⟩



Record views


Files downloads