105 search results - page 9 / 21 » Efficient elliptic curve exponentiation |
MYCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F2n , where n = 2 and is a positive integer. Our extractor, for a given poi...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
IJNSEC
2006
13 years 7 months ago
2006
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is ...
TC
2008
13 years 7 months ago
2008
RFID (Radio Frequency IDentification) tags need to include security functions, yet at the same time their resources are extremely limited. Moreover, to provide privacy, authenticat...