Hüseyin HişilCraig Costello2025-10-06201714321378, 093327900933-27901432-137810.1007/s00145-016-9227-7https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961162912&doi=10.1007%2Fs00145-016-9227-7&partnerID=40&md5=ad63556ac2ad5e2b81b575130692da89https://gcris.yasar.edu.tr/handle/123456789/9691This paper presents a new projective coordinate system and new explicit algorithms which together boost the speed of arithmetic in the divisor class group of genus 2 curves. The proposed formulas generalize the use of Jacobian coordinates on elliptic curves and their application improves the speed of performing cryptographic scalar multiplications in Jacobians of genus 2 curves over prime fields by an approximate factor of 1.25x. For example on a single core of an Intel Core i7-3770 (Ivy Bridge) we show that replacing the previous best formulas with our new set improves the cost of generic scalar multiplications from 239000 to 192000 cycles and drops the cost of specialized GLV-style scalar multiplications from 155000 to 123000 cycles. © 2017 Elsevier B.V. All rights reserved.EnglishExplicit Formulas, Genus 2, Hyperelliptic Curves, Jacobian Coordinates, Scalar Multiplication, Algorithms, Explicit Formula, Genus 2, Hyper-elliptic Curves, Jacobian Coordinate, Scalar Multiplication, GeometryAlgorithms, Explicit formula, Genus 2, Hyper-elliptic curves, Jacobian coordinate, Scalar multiplication, GeometryArticle