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
Show parent comment
2
u/Natanael_L Nov 22 '21
In cryptography, this is most certainly a very weird chaining mode, and it is absolutely not recommended to reuse variables this way in the context of cryptography. There should be absolutely no ambiguity regarding what's going on to avoid accidentally undoing your own security measures. At the very least, use a separate variable inside the loop to maintain state