Paper 2017/442
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
Jeremiah Blocki and Samson Zhou
Abstract
Argon2i is a data-independent memory hard function that won the password hashing competition. The password hashing algorithm has already been incorporated into several open source crypto libraries such as libsodium. In this paper we analyze the cumulative memory cost of computing Argon2i. On the positive side we provide a lower bound for Argon2i. On the negative side we exhibit an improved attack against Argon2i which demonstrates that our lower bound is nearly tight. In particular, we show that
(1) An Argon2i DAG is
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published by the IACR in TCC 2017
- Keywords
- Argon2iMemory Hard FunctionsDepth-Robustness
- Contact author(s)
- jblocki @ purdue edu
- History
- 2017-09-22: last of 4 revisions
- 2017-05-23: received
- See all versions
- Short URL
- https://ia.cr/2017/442
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/442, author = {Jeremiah Blocki and Samson Zhou}, title = {On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/442}, year = {2017}, url = {https://eprint.iacr.org/2017/442} }