Section: New Results

Implementation of cryptographic pairings

The extended version of a work on parallel architectures for the computation of the ${\eta }_T$ pairing over supersingular elliptic curves in characteristic 2 and 3, presented at CHES 2009 then accepted at IEEE Transaction on Computers in 2010, was finally published [3] . This paper was the result of a joint effort of Jérémie Detrey and Nicolas Estibals, in collaboration with Jean-Luc Beuchat and Eiji Okamoto (University of Tsukuba, Japan), Francisco Rodríguez-Henríquez (CINVESTAV-IPN, Mexico).

Also, the work on supersingular genus-2 pairings by Diego F. Aranha (UNICAMP, Brazil), Jean-Luc Beuchat (University of Tsukuba, Japan), Jérémie Detrey and Nicolas Estibals was accepted for publication at the Cryptographers' Track of the RSA Conference (CT-RSA 2012) [15] . Since last year, where only the Eta pairing algorithm was described, several major revisions were undertaken to improve this paper, among which a careful and detailed analysis of the various distortion maps of the considered family of hyperelliptic curves.

This study also allowed us to exhibit a somewhat simple distortion map which would enable this curve to benefit from the shorter loop of the Ate pairing algorithm. Exploring this option is currently work in progress, and the results should eventually be submitted to a journal.