The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs

DOI10.1007/978-3-031-22318-1_3zbMath1519.94058arXiv2110.04191OpenAlexW4312698707MaRDI QIDQ6169348

Seunghoon Lee, Blake Holman, Jeremiah Blocki

Publication date: 14 August 2023

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.04191

zbMATH Keywords

Argon2idata-independent memory-hard functionDRSampleparallel reversible pebbling

Mathematics Subject Classification ID

Games involving graphs (91A43) Cryptography (94A60) Games on graphs (graph-theoretic aspects) (05C57) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Corrigendum to ``Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• On sparse graphs with dense long paths
• Sustained space complexity
• On the depth-robustness and cumulative pebbling cost of Argon2i
• Moderately hard functions: definition, instantiations, and applications
• Data-independent memory hard functions: new attacks and stronger constructions
• Efficiently Computing Data-Independent Memory-Hard Functions
• High Parallel Complexity Graphs and Memory-Hard Functions
• Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks
• Random Oracles in a Quantum World
• Reversibility and adiabatic computation: trading time and space for energy
• Time/Space Trade-Offs for Reversible Computation
• Shifting Graphs and Their Applications
• On Time Versus Space
• Strengths and Weaknesses of Quantum Computing
• Depth-Robust Graphs and Their Cumulative Memory Complexity
• Eliminating intermediate measurements in space-bounded Quantum computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs