9659 search results - page 27 / 1932 » Points on Computable Curves |
DCC
2006
IEEE
14 years 8 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
GMP
2000
IEEE
14 years 1 months ago
2000
IEEE
A geometric approach to the computation of precise or well approximated tolerance zones for CAD constructions is given. We continue a previous study of linear constructions and fr...
DCC
2001
IEEE
14 years 8 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
We present an algorithm for counting points on superelliptic curves yr = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorit...
ANTS
2004
Springer
14 years 2 months ago
2004
Springer
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...