A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper we present a fast addition algorithm in the Jacobian of a Picard curve over a finite field Fq of characteristic different from 3. This algorithm has a nice geometric interpretation, comparable to the classic "chord and tangent" law for the elliptic curves. Computational cost for addition is 144M +12SQ+2I and 158M +16SQ+2I for doubling. In this article, we find explicit formulae for computing in the Jacobian of a Picard curve, basing us on some geometric aspects of these curves.doi:10.1007/978-3-540-24632-9_5 fatcat:ger33m5xabblbai5pak3bg27ma