8 search results - page 1 / 2 » Efficient Indifferentiable Hashing into Ordinary Elliptic Cu... |
CRYPTO
2010
Springer
13 years 12 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...
IJISEC
2008
13 years 11 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...
PAIRING
2009
Springer
14 years 5 months ago
2009
Springer
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 ...
DCC
2008
IEEE
14 years 10 months ago
2008
IEEE
We propose a simple and efficient deterministic extractor for an ordinary elliptic curve E, defined over F2n , where n = 2 and is a positive integer. Our extractor, for a given poi...
WAIFI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...