NtHash revisited

Table of Contents

• Quick introduction
• A new strategy
  • Inverse operation
  • Some more variants
  • TODO Repeated applications of \(f\)
  • Collisions
  • TODO Consecutive small values

\[ \newcommand{\rot}{\mathsf{rot}} \newcommand{\shift}{\mathsf{shift}} \]

Previously, I have written on:

• Collision-free NtHash-1, by changing the seeds so that no 64-bit hash collisions occur for \(k\) up to 32.
• Collisions in NtHash2, where the shorter rotations allow for periods larger than 64 (since the least common multiple of 31 and 33 is much larger), but this still has collisions at \(k=65\).
  • This still has some open questions on why, in practice, there are already structural hash collisions for \(k\leq 64\).

Furthermore, Igor Martayan wrote on correlations between small consecutive hash values.