Data-independent memory hard functions: new attacks and stronger constructions

DOI10.1007/978-3-030-26951-7_20OpenAlexW2902061482MaRDI QIDQ2304996

Lu Xing, Seunghoon Lee, Ben Harsha, Samson Zhou, Siteng Kang, Jeremiah Blocki

Publication date: 9 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_20

zbMATH Keywords

key cryptographic primitivepassword-hashing algorithms

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

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 ⋮ The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs ⋮ Study on massive-scale slow-hash recovery using unified probabilistic context-free grammar and symmetrical collaborative prioritization with parallel machines

This page was built for publication: Data-independent memory hard functions: new attacks and stronger constructions