Sciweavers

53 search results - page 1 / 11
» How to Hash into Elliptic Curves
Sort
View
32
Voted
CRYPTO
2009
Springer
156views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
How to Hash into Elliptic Curves
Thomas Icart
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves
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...
Eric Brier, Jean-Sébastien Coron, Thomas Ic...
ICICS
1997
Springer
14 years 3 days ago
Efficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
Atsuko Miyaji, Takatoshi Ono, Henri Cohen
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
14 years 2 months ago
The Tate Pairing Via Elliptic Nets
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
Katherine E. Stange
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
14 years 3 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...