Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves

Diego Aranha 1 Jean-Luc Beuchat 2 Jérémie Detrey 3, * Nicolas Estibals 3
* Auteur correspondant
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : This article presents a novel optimal pairing over supersingular genus-2 binary hyperelliptic curves. Starting from Vercauteren's work on optimal pairings, we describe how to exploit the action of the 2^{3m}-th power Verschiebung in order to further reduce the loop length of Miller's algorithm compared to the genus-2 Eta-T approach. As a proof of concept, we detail an optimized software implementation and an FPGA accelerator for computing the proposed optimal Eta pairing on a genus-2 hyperelliptic curve over F_{2^{367}} , which satisfies the recommended security level of 128 bits.
Type de document :
Communication dans un congrès
Orr Dunkelman. Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), Feb 2012, San Francisco, United States. Springer, pp.19, 2012
Liste complète des métadonnées


https://hal.inria.fr/inria-00540002
Contributeur : Jérémie Detrey <>
Soumis le : jeudi 25 novembre 2010 - 18:16:12
Dernière modification le : jeudi 22 septembre 2016 - 14:31:24
Document(s) archivé(s) le : vendredi 26 octobre 2012 - 16:51:08

Fichier

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

Identifiants

  • HAL Id : inria-00540002, version 1

Collections

Citation

Diego Aranha, Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals. Optimal Eta pairing on supersingular genus-2 binary hyperelliptic curves. Orr Dunkelman. Cryptographer's Track at the RSA Conference 2012 (CT-RSA 2012), Feb 2012, San Francisco, United States. Springer, pp.19, 2012. <inria-00540002>

Partager

Métriques

Consultations de
la notice

276

Téléchargements du document

215