To search, Click below search items.


All Published Papers Search Service


On the Performance of Provably Secure Hashing with Elliptic Curves


Anton Kargl, Bernd Meyer, Susanne Wetzel


Vol. 7  No. 10  pp. 1-7


We propose a cryptographic hash function based on the difficulty of computing discrete logarithms in the group of points of an elliptic curve over a finite field. We prove the security of the hash function and analyze the performance. Our implementation of the finite field, the elliptic curve arithmetic, and scalar multiplication is optimized for high throughput on modern 32-bit desktop processors. The achievable data rates allow the use of provably secure hash functions in practical applications.


Hash Function, Elliptic Curve Cryptosystem, Koblitz Curve, Optimal Extension Field, Frobenius Representation