17 search results - page 1 / 4 » Efficient pairing computation on supersingular Abelian varie... |
DCC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
PAIRING
2010
Springer
13 years 2 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
PAMI
2010
13 years 3 months ago
2010
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...