1469 search results - page 45 / 294 » Discretization of a Continuous Curve |
135
Voted
INDOCRYPT
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
95
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...
93
Voted
SMA
2008
ACM
15 years 29 days ago
2008
ACM
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
154
Voted
CGF
2011
14 years 4 months ago
2011
We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2material volume fractions with a high degree of accuracy. Although Marchi...
134
click to vote
PKC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...