New answers tagged

3 votes

Reversible streaming hash function

As stated, the problem is impossible (with a non-trivial hash function). Consider the case n=2, then you have that, for example, $$h(h(0, 1), 2) = h(h(0, 2), 1)$$ That implies that $$h(h(h(0, 1), 2), ...
Carlos Miguel Soto's user avatar
2 votes

Reversible streaming hash function

There are several polynomial-based hash functions $H$, where you can rapidly compute $H(m)$ or $H(\text{rev}(m))$ given $m$, and you can do both in a streaming fashion. See below for several ...
D.W.'s user avatar
  • 156k

Top 50 recent answers are included