Talk:Elliptic curve only hash

This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Cryptography: Computer science This article is within the scope of WikiProject Cryptography, a collaborative effort to improve the coverage of Cryptography on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.CryptographyWikipedia:WikiProject CryptographyTemplate:WikiProject CryptographyCryptography articles ??? This article has not yet received a rating on the importance scale. This article is supported by WikiProject Computer science.

I came upon this article by chance. Having a little knowledge of computer programming, I think I know what it is about, but wouldn't it be better if someone was to indicate the purpose and usage of the algorithm? At a minimum, it needs to be linked to Hash function (assuming that this is what it is actually about). I'd make the edit myself, but I'm not exactly confident I've not misunderstood. I think this suggestion falls under the WP:OBVIOUS editing recommendation. AndyTheGrump (talk) 17:45, 10 October 2010 (UTC)[reply]

The ECOH is based on the MuHASH hash algorithm, that has not yet been successfully attacked. However, MuHASH is too inefficient for practical use and changes had to be made. The main difference is that where MuHASH applies a random oracle, ECOH applies a padding function.

Random oracle is a theoretical construct that is impossible to create in practice. If MuHASH really depends on a random oracle, then it isn't too inefficient to use, it's impossible to use; the question of whether it has been successfully attacked is academic. (In fact, a random oracle would itself serve as a perfect hash function.) - Mike Rosoft (talk) 20:22, 8 February 2015 (UTC)[reply]