International audienceThis 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
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3...
Following the emergence of Kim and Barbulescu\u27s new number field sieve (exTNFS) algorithm at CRYP...
Pairings are cryptographic primitives which are now used in numerous protocols. Computing and implem...
Abstract. This article presents a novel optimal pairing over supersin-gular genus-2 binary hyperelli...
In this paper we simplify and extend the Eta pairing, originally discovered in the setting of supers...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
International audienceThis paper is devoted to the design of fast parallel accelerators for the cryp...
International audienceThis paper presents a novel method for designing compact yet efficient hardwar...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
AbstractRecent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duur...
This paper describes the design of a fast software library for the computation of the optimal ate pa...
While FPGA is a suitable platform for implementing cryptographic algorithms, there are several chall...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
International audienceSince their introduction in constructive cryptographic applications, pairings ...
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3...
Following the emergence of Kim and Barbulescu\u27s new number field sieve (exTNFS) algorithm at CRYP...
Pairings are cryptographic primitives which are now used in numerous protocols. Computing and implem...
Abstract. This article presents a novel optimal pairing over supersin-gular genus-2 binary hyperelli...
In this paper we simplify and extend the Eta pairing, originally discovered in the setting of supers...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
International audienceThis paper is devoted to the design of fast parallel accelerators for the cryp...
International audienceThis paper presents a novel method for designing compact yet efficient hardwar...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
AbstractRecent developments on the Tate or Eta pairing computation over hyperelliptic curves by Duur...
This paper describes the design of a fast software library for the computation of the optimal ate pa...
While FPGA is a suitable platform for implementing cryptographic algorithms, there are several chall...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
International audienceSince their introduction in constructive cryptographic applications, pairings ...
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3...
Following the emergence of Kim and Barbulescu\u27s new number field sieve (exTNFS) algorithm at CRYP...
Pairings are cryptographic primitives which are now used in numerous protocols. Computing and implem...