Sciweavers

44 search results - page 1 / 9
» Computing in Component Groups of Elliptic Curves
Sort
View
72
Voted
ANTS
2008
Springer
106views Algorithms» more  ANTS 2008»
15 years 27 days ago
Computing in Component Groups of Elliptic Curves
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
J. E. Cremona
103
Voted
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 5 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
85
Voted
ICIP
2004
IEEE
16 years 14 days ago
Elliptic arc vectorization for 3d pie chart recognition
In this paper, we present a novel approach to vectorize elliptic arcs for 3D pie chart recognition and data extraction. As a preprocessing step, a set of straight line segments ar...
Weihua Huang, Chew Lim Tan, Wee Kheng Leow
84
Voted
JSC
2011
100views more  JSC 2011»
14 years 1 months ago
Toric forms of elliptic curves and their arithmetic
We scan a large class of one-parameter families of elliptic curves for efficient arithmetic. The construction of the class is inspired by toric geometry, which provides a natural ...
Wouter Castryck, Frederik Vercauteren