Skip to main content
1 of 4
AleksanderCH
  • 6.5k
  • 10
  • 29
  • 63

No, that's actually pretty easy to compute, because you only have to compute all possible hashes of possible two strings, which would be $n^2$, where $n$ is the number of possible characters / symbols.

AleksanderCH
  • 6.5k
  • 10
  • 29
  • 63