105 search results - page 2 / 21 » Efficient elliptic curve exponentiation |
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We provide the first construction of a hash function into ordinary elliptic curves that is indifferentiable from a random oracle, based on Icart's deterministic enco...
AMC
2005
13 years 4 months ago
2005
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
ACNS
2009
Springer
13 years 11 months ago
2009
Springer
We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplicat...
EUROCRYPT
2009
Springer
14 years 5 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...
IJISEC
2008
13 years 4 months ago
2008
The Ate pairing has been suggested since it can be computed efficiently on ordinary elliptic curves with small values of the traces of Frobenius t. However, not all pairing-friendl...