Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers

Abstract : We give one-and two-dimensional scalar multiplication algorithms for Jacobians of genus 2 curves that operate by projecting to Kummer surfaces, where we can exploit faster and more uniform pseudo-multiplication, before recovering the proper "signed" output back on the Jacobian. This extends the work of López and Dahab, Okeya and Sakurai, and Brier and Joye to genus 2, and also to two-dimensional scalar multiplication. The technique is especially interesting in genus 2, because Kummer surfaces can outperform comparable elliptic curve systems.
Type de document :
Communication dans un congrès
Selected Areas in Cryptography - SAC 2016, Aug 2016, St John's, Canada. Springer, Lecture Notes in Computer Science (10532), pp.18, 2017, Selected Areas in Cryptography - SAC 2016. 〈10.1007/978-3-319-69453-5_25〉
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01353480
Contributeur : Benjamin Smith <>
Soumis le : jeudi 10 novembre 2016 - 08:17:03
Dernière modification le : jeudi 10 mai 2018 - 02:07:00
Document(s) archivé(s) le : mardi 14 mars 2017 - 14:01:57

Fichiers

recovery.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Copyright (Tous droits réservés)

Identifiants

Citation

Ping Ngai Chung, Craig Costello, Benjamin Smith. Fast, uniform scalar multiplication for genus 2 Jacobians with fast Kummers. Selected Areas in Cryptography - SAC 2016, Aug 2016, St John's, Canada. Springer, Lecture Notes in Computer Science (10532), pp.18, 2017, Selected Areas in Cryptography - SAC 2016. 〈10.1007/978-3-319-69453-5_25〉. 〈hal-01353480〉

Partager

Métriques

Consultations de la notice

294

Téléchargements de fichiers

159