53 search results - page 9 / 11 » How to Hash into Elliptic Curves |
162
click to vote
COMSWARE
2007
IEEE
16 years 8 days 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...
161
click to vote
ASIACRYPT
2005
Springer
15 years 11 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...
197
click to vote
COMCOM
2011
15 years 29 days 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 ...
139
click to vote
MOC
1998
15 years 5 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...
134
click to vote
ANTS
2006
Springer
15 years 9 months 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 ...