Efficient pairing computation on supersingular Abelian varieties

@article{Barreto2004EfficientPC,
  title={Efficient pairing computation on supersingular Abelian varieties},
  author={Paulo Barreto and Steven D. Galbraith and Colm O'hEigeartaigh and Michael Scott},
  journal={Designs, Codes and Cryptography},
  year={2004},
  volume={42},
  pages={239-271}
}
We present a general technique for the efficient computation of pairings on Jacobians of supersingular curves. This formulation, which we call the eta pairing, generalizes results of Duursma and Lee for computing the Tate pairing on supersingular elliptic curves in characteristic 3. We then show how our general technique leads to a new algorithm which is about twice as fast as the Duursma–Lee method. These ideas are applied to elliptic and hyperelliptic curves in characteristic 2 with very… 
Efficient Pairing Computation on Curves
TLDR
A method for the efficient computation of Tate pairings on curves which is a generalization of Barreto, etc.
Efficient and Generalized Pairing Computation on Abelian Varieties
TLDR
Using the R-ate pairing, the loop length in Miller's algorithm can be as small as log (r1/phi(k)) some pairing-friendly elliptic curves which have not reached this lower bound.
Computation of Tate Pairing for Supersingular Curves over characteristic 5 and 7
TLDR
Tate pairing over supersingular elliptic curves is computed via the generic BGhES[3] method for p = 5;7.
Speeding up the Bilinear Pairings Computation on Curves with Automorphisms
TLDR
A new algorithm for computing the bilinear pairings on a family of non-supersingular elliptic curves with non-trivial automorphisms is presented, which is as efficient as the algorithm in Miller's algorithm.
Computing bilinear pairings on elliptic curves with automorphisms
TLDR
A novel method for constructing a super-optimal pairing with great efficiency is presented, which requires the simple final exponentiation and short loop length in Miller's algorithm which leads to a significant improvement over the previously known techniques on certain pairing-friendly curves.
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three
TLDR
To construct the algorithm, the denominator elimination technique and the signed-binary approach to the Miller's algorithm are applied, and the final exponentiation is improved to improve the efficiency of the proposed method through an experimental implementation.
Pairing Calculation on Supersingular Genus 2 Curves
TLDR
It is found that, contrary to the results reported in [8], pairing calculation on supersingular genus 2 curves over prime fields is efficient and a viable candidate for the practical implementation of pairing-based cryptosystems.
Pairing with Supersingular Trace Zero Varieties Revisited
TLDR
This paper presents a new algorithm for the Tate pairing over supersingular TZV, which exploits the action of the q-Frobenius, and proposes a more efficient variant of the Silverberg’s point compression algorithm.
TATE PAIRING COMPUTATION ON THE DIVISORS OF HYPERELLIPTIC CURVES OF GENUS 2
We present an explicit Eta pairing approach for computing the Tate pairing on general divisors of hyperelliptic curves Hd of genus 2, where Hd : y 2 + y = x5 + x3 + d is defined over F2n with d = 0
...
...

References

SHOWING 1-10 OF 41 REFERENCES
Efficient Tate Pairing Computation for Elliptic Curves over Binary Fields
TLDR
There are exactly three isomorphism classes of supersingular elliptic curves over $\mathbb F_{2^m}$ for odd m and the result is applicable to all these curves.
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
TLDR
This work transfers techniques recently developed for torus-based cryptography to pairing- based cryptography, resulting in more efficient computations, and lower bandwidth requirements, to illustrate the efficacy of this approach.
Efficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
  • Soonhak Kwon
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2004
TLDR
A closed formula for the Tate pairing computation for supersingular elliptic curves defined over the binary field F2m of odd dimension is presented and it is shown that this algorithm and also the Duursma-Lee algorithm can be modified to another algorithm which does not need any inverse Frobenius operation.
Efficient Doubling on Genus Two Curves over Binary Fields
TLDR
This paper investigates how to compute faster doubling over fields of characteristic two by derive explicit doubling formulae making strong use of the defining equation of the curve and analyze how many field operations are needed depending on the curve making clear how much generality one loses by the respective choices.
Supersingular Abelian Varieties in Cryptology
TLDR
This paper determines exactly which values can occur as the security parameters of supersingular abelian varieties (in terms of the dimension of theAbelian variety and the size of the finite field), and gives constructions of supersedication varieties that are optimal for use in cryptography.
Supersingular Curves in Cryptography
TLDR
Bounds on the possible values for k in the case of supersingular curves are given which imply that supersingULAR curves are weaker than the general case for cryptography, by generalising an identity-based cryptosystem due to Boneh and Franklin.
Efficient Implementation of Pairing-Based Cryptosystems
TLDR
This paper describes how to construct ordinary (non-supersingular) elliptic curves containing groups with arbitrary embedding degree, and shows how to compute the Tate pairing on these groups efficiently.
A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves
The aim of this paper is to show that the computation of the discrete logarithm in the m-torsion part of the divisor class group of a curve X over a finite field ko (with char(ko) prime to m), or
Formulae for Arithmetic on Genus 2 Hyperelliptic Curves
  • T. Lange
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2004
TLDR
This article presents explicit formulae to perform the group operations for genus 2 curves and introduces a new system of coordinates and state algorithms showing that doublings are comparably cheap and no inversions are needed.
Fast Bilinear Maps from the Tate-Lichtenbaum Pairing on Hyperelliptic Curves
TLDR
This paper considers the Tate pairing on hyperelliptic curves of genus g and gives mathematically sound arguments why it is possible to use particular representatives of the involved residue classes in the second argument that allow to compute the pairing much faster, where the speed-up grows with the size of g.
...
...