hash

But why does it actually matter if either the hash function or hash value comparison takes data-dependent time?

I then try passwords where the first character of the password hash is 'f' and the second is different.

So, the argument is because the hash is displayed it can be reversed by subsequently hashing every known combination of characters with every known mail provider?

Specifically: I try passwords where the first character of the hash is different.

- hash these URLs on server, and use a not-too-unique hash function.

Then when the websites generate hashes, they can then append the salt and generate the hash.

Especially once you start talking about table lookups / etc (although that's more common with encryption algorithms than straight hash algorithms).

Let's see if we can reverse engineer this email hash to find out who this rogue might be!

You can easily & transparently move it from one physical place to another; your hash identifies it, not the physical routing location.

The hashes generally used for things like hash tables don't need to be cryptographically secure, and as such can be substantially simpler.

However, rather than re-hash all that, it's worth taking a look at the numbers - numbers that absolutely indicate a younger skewing workforce.

Effectively, by leaking internal state of the cypher / hash through timing variations.

A convenient addition the library would be a Seq/Hash that delegates to a "regular" List or Map without copying.

If this has been inside the UE and the x itself was a hash value then both replacing with printf("%s",x) and changing the x's value could be problematic.