New Formulae for Efficient Elliptic Curve Arithmetic

@inproceedings{Hisil2007NewFF,
  title={New Formulae for Efficient Elliptic Curve Arithmetic},
  author={H{\"u}seyin Hisil and Gary Carter and Ed Dawson},
  booktitle={INDOCRYPT},
  year={2007}
}
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… CONTINUE READING
Highly Cited
This paper has 40 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Explicit-formulas database, Accessible through: http://hyperelliptic.org/EFD

  • D. J. Bernstein, T. Lange
  • 2007
Highly Influential
19 Excerpts