9659 search results - page 80 / 1932 » Points on Computable Curves |
106
click to vote
DCC
2007
IEEE
15 years 11 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 ...
MVA
1992
15 years 1 months ago
1992
Module-1 :Computation of gradient directions. Reconstruction of a set of imperfect contour curves which is extracted :Assignment of discreteheight to contourcurves. from a topograp...
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
An elliptic curve random number generator (ECRNG) has been approved in a NIST standards and proposed for ANSI and SECG draft standards. This paper proves that, if three conjecture...
ANTS
2000
Springer
15 years 4 months ago
2000
Springer
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
CAD
2006
Springer
14 years 12 months ago
2006
Springer
Fat arcs form bounding boxes for planar curves. An example on approximation by fat arcs, provided by Qun and Rokne, is corrected. The third derivative of the given curve segment u...