On the depth-robustness and cumulative pebbling cost of Argon2i

DOI10.1007/978-3-319-70500-2_15zbMath1410.94048OpenAlexW2729715767MaRDI QIDQ1690203

Samson Zhou, Jeremiah Blocki

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_15

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Static-memory-hard functions, and modeling the cost of space vs. time ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions ⋮ Unnamed Item ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs

This page was built for publication: On the depth-robustness and cumulative pebbling cost of Argon2i