31 search results - page 2 / 7 » Improved Algorithms for Efficient Arithmetic on Elliptic Cur... |
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
TIT
2010
12 years 11 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
ASIACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
IJNSEC
2010
12 years 11 months ago
2010
The efficiency of the core Galois field arithmetic improves the performance of elliptic curve based public key cryptosystem implementation. This paper describes the design and imp...
CHES
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report ...