209 search results - page 6 / 42 » Supersingular Curves in Cryptography |
AICCSA
2006
IEEE
14 years 1 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...
ISCAS
2002
IEEE
14 years 23 days ago
2002
IEEE
FPGAs are an attractive platform for elliptic curve cryptography hardware. Since field multiplication is the most critical operation in elliptic curve cryptography, we have studi...
EUROCRYPT
2009
Springer
14 years 8 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...
FCCM
2008
IEEE
14 years 2 months ago
2008
IEEE
EUROCRYPT
1999
Springer
14 years 3 days ago
1999
Springer
Abstract. This paper addresses the discrete logarithm problem in elliptic curve cryptography. In particular, we generalize the Menezes, Okamoto, and Vanstone (MOV) reduction so tha...