Jump to content

Talk:Elliptic curve only hash

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

What is this article about?

[edit]

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]

MuHASH and random oracle

[edit]
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]