Sciweavers

9659 search results - page 93 / 1932
» Points on Computable Curves
Sort
View
MOC
1998
85views more  MOC 1998»
15 years 6 months ago
Remarks on the Schoof-Elkies-Atkin algorithm
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
L. Dewaghe
WAIFI
2007
Springer
141views Mathematics» more  WAIFI 2007»
16 years 17 days ago
New Point Addition Formulae for ECC Applications
Abstract. In this paper we propose a new approach to point scalar multiplication on elliptic curves defined over fields of characteristic greater than 3. It is based on new point...
Nicolas Meloni
ASIACRYPT
2008
Springer
15 years 8 months ago
Twisted Edwards Curves Revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
CCCG
2007
15 years 8 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...