Joppe W. BosCraig CostelloHuseyin HisilKristin LauterBos, Joppe W.Lauter, KristinCostello, CraigHisil, HuseyinG BertoniJS Coron2025-10-062013978-3-642-40349-1, 978-3-642-40348-4978364240348497836424034910302-97431611-334910.1007/978-3-642-40349-1_192-s2.0-84890775778https://gcris.yasar.edu.tr/handle/123456789/6615https://doi.org/10.1007/978-3-642-40349-1_19This paper explores the potential for using genus 2 curves over quadratic extension fields in cryptography motivated by the fact that they allow for an 8-dimensional scalar decomposition when using a combination of the GLV/GLS algorithms. Besides lowering the number of doublings required in a scalar multiplication this approach has the advantage of performing arithmetic operations in a 64-bit ground field making it an attractive candidate for embedded devices. We found cryptographically secure genus 2 curves which although susceptible to index calculus attacks aim for the standardized 112-bit security level. Our implementation results on both high-end architectures (Ivy Bridge) and low-end ARM platforms (Cortex-A8) highlight the practical benefits of this approach.Englishinfo:eu-repo/semantics/closedAccessHYPERELLIPTIC CURVES, ELLIPTIC-CURVES, WEIL DESCENT, CRYPTOGRAPHY, ENDOMORPHISMS, ALGORITHM, GENUSConference Object