Balloon hashing

Last updated

Balloon hashing is a key derivation function presenting proven memory-hard password-hashing and modern design. It was created by Dan Boneh, Henry Corrigan-Gibbs (both at Stanford University) and Stuart Schechter (Microsoft Research) in 2016. [1] [2]

Contents

The authors claim that Balloon:

Balloon is compared by its authors with Argon2, a similarly performing algorithm. [1]

Algorithm

There are three steps in the algorithm: [1]

  1. Expansion, where an initial buffer is filled with a pseudorandom byte sequence derived from the password and salt repeatedly hashed.
  2. Mixing, where the bytes in the buffer are mixed time_cost number of times.
  3. Output, where a portion of the buffer is taken as the hashing result.

References

  1. 1 2 3 Boneh, Dan; Corrigan-Gibbs, Henry; Schechter, Stuart (2016-01-11). "Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks". Cryptology ePrint Archive. 2016 (27). Retrieved 2019-09-03.
  2. ↑ "Balloon Hashing". Stanford Applied Crypto Group. Stanford University. Retrieved 2019-09-03.

Further reading


This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.