9 search results - page 2 / 2 » Efficient Tate pairing computation using double-base chains |
DCC
2007
IEEE
14 years 5 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 ...
CP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
We propose Markov chain Monte Carlo sampling methods to address uncertainty estimation in disparity computation. We consider this problem at a postprocessing stage, i.e. once the d...
DSN
2009
IEEE
13 years 10 months ago
2009
IEEE
The Border Gateway Protocol (BGP) is a fundamental building block of the Internet infrastructure. However, due to the implicit trust assumption among networks, Internet routing re...