9659 search results - page 36 / 1932 » Points on Computable Curves |
CARDIS
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. A computationally limited device (typically a smart-card) will delegate the computa...
ANTS
2004
Springer
14 years 3 months ago
2004
Springer
We present a non-archimedean method to construct, given an integer N ≥ 1, a finite field Fq and an elliptic curve E/Fq such that E(Fq) has order N.
SMA
2009
ACM
14 years 4 months ago
2009
ACM
We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps. Firstly, the normal vectors at points...
FOCS
2002
IEEE
14 years 2 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
ICPR
2000
IEEE
14 years 2 months ago
2000
IEEE
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically ¢¡£ to...