期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2007
卷号：7
期号：10
页码：1-7
出版社：International Journal of Computer Science and Network Security
摘要：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.
