1730 search results - page 8 / 346 » Shimura Curve Computations |
DCC
2007
IEEE
14 years 7 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 ...
MOC
2011
13 years 1 months ago
2011
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
IEEECGIV
2009
IEEE
14 years 2 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
EUROCRYPT
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
ICPR
2000
IEEE
14 years 8 months ago
2000
IEEE
We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we ...