53 search results - page 9 / 11 » How to Hash into Elliptic Curves |
COMSWARE
2007
IEEE
14 years 2 months ago
2007
IEEE
The Elliptic Curve Digital Signature Algorithm admits a natural parallelization wherein the point multiplication step can be split in two parts and executed in parallel. Further pa...
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
COMCOM
2011
13 years 3 months ago
2011
Key distribution in Wireless Sensor Networks (WSNs) is challenging. Symmetric cryptosystems can perform it efficiently, but they often do not provide a perfect trade-off between ...
MOC
1998
13 years 8 months ago
1998
Abstract. Schoof’s algorithm computes the number m of points on an elliptic curve E defined over a finite field Fq. Schoof determines m modulo small primes using the character...
ANTS
2006
Springer
14 years 9 days ago
2006
Springer
The security and performance of pairing based cryptography has provoked a large volume of research, in part because of the exciting new cryptographic schemes that it underpins. We ...