76 search results - page 2 / 16 » Pipelining GF(P) Elliptic Curve Cryptography Computation |
FPL
2010
Springer
14 years 8 months ago
2010
Springer
Integer addition is a universal building block, and applications such as quad-precision floating-point or elliptic curve cryptography now demand precisions well beyond 64 bits. Thi...
94
Voted
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
86
Voted
CMA
2010
14 years 6 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
IEICET
2008
14 years 10 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...
109
click to vote
ACISP
2007
Springer
15 years 2 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...