105 search results - page 1 / 21 » Efficient elliptic curve exponentiation |
ICICS
1997
Springer
13 years 10 months ago
1997
Springer
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
IEICET
2008
13 years 6 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
ICISC
2004
13 years 7 months ago
2004
Abstract. This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and ...
CHES
2004
Springer
13 years 10 months ago
2004
Springer
In the execution on a smart card, side channel attacks such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat [15]. Side channel a...
PKC
1998
Springer
13 years 10 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...