Tag Info

Hot answers tagged

3

The premise that people cannot make a memory intensive password hashing function is incorrect. scrypt does approximately what is described in the question. Of course you still want to limit the amount of memory, especially if many of these hashes are to be calculated in parallel. Furthermore, you could have a look at the password hashing competition where ...


1

In theory, it is not: TOTP, like HOTP, is based on a Hash-based message authentication code (HMAC), which in turn relies on a cryptographic hash. Both the key, and the HMAC message (a time counter in TOTP) are hashed using the specified cryptographic hash. One key goal of cryptographic hashes is: it should be infeasible to generate a message that has a ...



Only top voted, non community-wiki answers of a minimum length are eligible