Tradeoff Cryptanalysis of Memory-Hard Functions

DOI10.1007/978-3-662-48800-3_26MaRDI QIDQ2795993zbMATH OpenOpenAlexFDO

Authors Alex Biryukov, Dmitry Khovratovich

Publication date 23 March 2016

Published in Advances in Cryptology – ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48800-3_26

zbMATH Keywords

catenacryptocurrencymemory-hardpassword hashingproof-of-worktradeoff

Mathematics Subject Classification ID

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

Recommendations

• Memory-hard functions from cryptographic primitives
• A cryptanalytic time-memory trade-off
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• Advances in Cryptology - CRYPTO 2003
• Data-independent memory hard functions: new attacks and stronger constructions
• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Performance comparison of cryptanalytic time memory data tradeoff methods
• Time-Memory Trade-Off Attacks on Multiplications and T-Functions

Cited in

(18)

• Static-memory-hard functions, and modeling the cost of space vs. time
• Time-memory tradeoff attacks on the MTP proof-of-work scheme
• Bandwidth hard functions for ASIC resistance
• Symmetrically and asymmetrically hard cryptography
• Disproving the conjectures from ``On the complexity of \textsf{scrypt} and proofs of space in the parallel random oracle model
• Data-independent memory hard functions: new attacks and stronger constructions
• Efficiently computing data-independent memory-hard functions
• Memory-demanding password scrambling
• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• A new algorithm for the unbalanced meet-in-the-middle problem
• Proof of space from stacked expanders
• Bad directions in cryptographic hash functions
• Rig: a simple, secure and flexible design for password hashing
• Depth-robust graphs and their cumulative memory complexity
• Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
• Cost-asymmetric memory hard password hashing
• Trapdoor memory-hard functions
• Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation

This page was built for publication: Tradeoff Cryptanalysis of Memory-Hard Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795993)