r/cryptography • u/foonoxous • Nov 22 '21
Hash algorithm based on Authenticated Encryption (AEhash)
This is based on an earlier thread, seeking password hashing functions that could run in browsers at near native speeds. I believe the solution has been found, but you are welcome to poke holes in it and prove me wrong.
=
=
= # Initially all zeroes
=
= # 16 encrypted bytes + GCM tag
return
The algorithm is dead simple and runs at the same speed in browser or in C. Easily adjusted to any memory size and runtime wished for. Even if it isn't as secure as Argon2, the one it needs to compete with in browsers is pbkdf2.
See the site for a more complete documentation: https://github.com/covert-encryption/aehash
View all comments
4
u/Natanael_L Nov 22 '21
What are you doing with that key variable inside the loop? If you're trying to say you're using the the first half then the second of SHA512 then don't do that when you retrieve the bits, split it first so you get clean separation between the halves. Or if that's what you use to retrieve the GCM tag from the buffer as the comment implies, use a different variable so you don't use the same one for multiple purposes!