AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding degree with respect to a large prime-order subgroup. In this paper we construct pairing-friendly genus 2 curves over finite fields Fq whose Jacobians are ordinary and simple, but not absolutely simple. We show that constructing such curves is equivalent to constructing elliptic curves over Fq that become pairing-friendly over a finite extension of Fq. Our main proof technique is Weil restriction of elliptic curves. We describe adaptations of the Cocks–Pinch and Brezing–Weng methods that produce genus 2 curves with the desired properties. Our examples include a parametric family of genus 2 curves whose Jacobians have the smallest recorded ρ-val...
International audienceWe give an elementary and self-contained introduction to pairings on elliptic ...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
Constructing pairing-friendly hyperelliptic curves with small $\rho$-values is one of challenges for...
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational poi...
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational poi...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
International audienceThe use of (hyper)elliptic curves in cryptography relies on the ability to com...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
International audienceWe give an elementary and self-contained introduction to pairings on elliptic ...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
Constructing pairing-friendly hyperelliptic curves with small $\rho$-values is one of challenges for...
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational poi...
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational poi...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel prop...
International audienceThe use of (hyper)elliptic curves in cryptography relies on the ability to com...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...
International audienceWe give an elementary and self-contained introduction to pairings on elliptic ...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
The security of many public-key cryptosystems relies on the existence of groups in which the discret...