105 search results - page 7 / 21 » Efficient elliptic curve exponentiation |
AMC
2006
13 years 7 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
CRYPTO
2004
Springer
14 years 27 days ago
2004
Springer
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
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...
CRYPTO
1991
Springer
13 years 11 months ago
1991
Springer
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...