Sciweavers

1730 search results - page 80 / 346
» Shimura Curve Computations
Sort
View
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
15 years 9 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
ISDA
2006
IEEE
15 years 10 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
15 years 10 months ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
CVPR
1998
IEEE
15 years 8 months ago
Curves Matching Using Geodesic Paths
We present a method for matching curves which accommodates large and small deformation. The method preserves geometric similarities in the case of small deformation, and loosens t...
Isaac Cohen, Isabelle Herlin
COMGEO
2007
ACM
15 years 4 months ago
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...