Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive criterion but luckily constructions for pairing-friendly elliptic curves with such twists exist. In fact, Freeman, Scott and Teske showed in their overview paper that often the best known methods of constructing pairing-friendly elliptic curves over fields of large prime characteristic produce curves that admit twists of degree 3, 4 or 6. A few papers have presented explicit formulas for the doubling and the addition step in Miller’s algorithm, but the optimizations were all done for the Tate pairing with degree-2 twists, so the main usage of the high- degree tw...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In part...
Research on efficient pairing implementation has focussed on reducing the loop length and on using h...
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3...
At Pairing 2010, Lauter et al\u27s analysis showed that Ate pairing computation in affine coordinate...
In this paper, we propose an elaborate geometry approach to explain the group law on twisted Edwards...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
In this paper, we propose an elaborate geometric approach to explain the group law on Jacobi quartic...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a parti...
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatur...
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 ...
Self-pairings have found interesting applications in cryptographic schemes. In this paper, we pres...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In part...
Research on efficient pairing implementation has focussed on reducing the loop length and on using h...
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3...
At Pairing 2010, Lauter et al\u27s analysis showed that Ate pairing computation in affine coordinate...
In this paper, we propose an elaborate geometry approach to explain the group law on twisted Edwards...
International audienceThis paper proposes the computation of the Tate pairing, Ate pairing and its v...
In this paper, we propose an elaborate geometric approach to explain the group law on Jacobi quartic...
One of the challenges in the designing of pairing-based cryptographic protocols is to construct suit...
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a parti...
The Tate pairing has plenty of attractive applications, e.g., ID-based cryptosystems, short signatur...
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 ...
Self-pairings have found interesting applications in cryptographic schemes. In this paper, we pres...
AbstractTextThis paper proposes new explicit formulas for the doubling and addition steps in Miller'...
Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such as BW13...
We describe fast new algorithms to implement recent cryptosystems based on the Tate pairing. In part...