32 search results - page 2 / 7 » Faster Addition and Doubling on Elliptic Curves |
9
Voted
AICCSA
2006
IEEE
13 years 11 months ago
2006
IEEE
This paper proposes a new method to compute Elliptic Curve Cryptography in Galois Fields GF(p). The method incorporates pipelining to utilize the benefit of both parallel and seri...
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. It has been recently acknowledged [4, 6, 9] that the use of double bases representations of scalars n, that is an expression of the form n = e,s,t(-1)e As Bt can speed up...
IPL
2007
13 years 4 months ago
2007
The use of elliptic curve cryptosystems on embedded systems has been becoming widespread for some years. Therefore the resistance of such cryptosystems to side-channel attacks is ...
IWSEC
2010
Springer
13 years 2 months ago
2010
Springer
We use two parametrizations of points on elliptic curves in generalized Edwards form x2 + y2 = c2 (1 + dx2 y2 ) that omit the xcoordinate. The first parametrization leads to a diff...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
This paper describes several speedups and simpliļ¬cations for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...