Sciweavers

1730 search results - page 39 / 346
» Shimura Curve Computations
Sort
View
121
Voted
ACSW
2007
15 years 2 months ago
Isogeny cordillera algorithm to obtain cryptographically good elliptic curves
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computati...
Josep M. Miret, D. Sadornil, J. Tena, R. Tomas, Ma...
94
Voted
SMI
2005
IEEE
15 years 6 months ago
Two-Dimensional Visibility Charts for Continuous Curves
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
Gershon Elber, Robert Sayegh, Gill Barequet, Ralph...
111
Voted
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
15 years 7 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
89
Voted
CVPR
2007
IEEE
16 years 2 months ago
Texture-Preserving Shadow Removal in Color Images Containing Curved Surfaces
Several approaches to shadow removal in color images have been introduced in recent years. Yet these methods fail in removing shadows that are cast on curved surfaces, as well as ...
Eli Arbel, Hagit Hel-Or
102
Voted
EUROPKI
2004
Springer
15 years 6 months ago
On the Use of Weber Polynomials in Elliptic Curve Cryptography
Abstract. In many cryptographic applications it is necessary to generate elliptic curves (ECs) with certain security properties. These curves are commonly constructed using the Com...
Elisavet Konstantinou, Yannis C. Stamatiou, Christ...