Add to ORKGConstructing pairing-friendly hyperelliptic curves with small $\rho$-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe a method that extends the Kawazoe-Takahashi method of generating families of genus $2$ ordinary pairing-friendly hyperelliptic curves by parameterizing the parameters as polynomials. With this approach we construct genus $2$ ordinary pairing-friendly hyperelliptic curves with $2 <\rho \le 3$
For the Tate pairing computation over hyperelliptic curves, there are developments by Duursma-Lee an...
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a parti...
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...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
International audienceThe use of (hyper)elliptic curves in cryptography relies on the ability to com...
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...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
We present two contributions in this paper. First, we give a quantitative analysis of the scarcity o...
For the Tate pairing computation over hyperelliptic curves, there are developments by Duursma-Lee an...
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a parti...
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...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
AbstractA pairing-friendly curve is a curve over a finite field whose Jacobian has small embedding d...
International audienceThe use of (hyper)elliptic curves in cryptography relies on the ability to com...
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...
In this paper we describe how to efficiently implement pairing calculation on supersingular genus~2 ...
La recherche de nouveaux groupes autres que le groupe multiplicatif pour concevoir des protocoles pl...
We present two contributions in this paper. First, we give a quantitative analysis of the scarcity o...
For the Tate pairing computation over hyperelliptic curves, there are developments by Duursma-Lee an...
A self-pairing is a pairing computation where both inputs are the same group element. Self-pairings ...
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a parti...