A tight lower bound on the \textsc{TdScrypt} trapdoor memory-hard function

DOI10.62056/A0L2I888MaRDI QIDQ7390765zbMATH OpenFDO

Authors Jeremiah Blocki, Seunghoon Lee

Publication date 2025

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0L2I888

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Balloon hashing: a memory-hard function providing provable protection against sequential attacks
• Bandwidth hard functions for ASIC resistance
• Complexity of a determinate algorithm for the discrete logarithm
• Cryptography and Coding
• Data-independent memory hard functions: new attacks and stronger constructions
• High Parallel Complexity Graphs and Memory-Hard Functions
• scientific article; zbMATH DE number 1583771 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• Memory-demanding password scrambling
• On the multi-user security of short Schnorr signatures with preprocessing
• Optimal security proofs for signatures from identification schemes
• PURED: a unified framework for resource-hard functions
• Scrypt is maximally memory-hard
• Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions
• Symmetrically and asymmetrically hard cryptography
• The Discrete Logarithm problem with preprocessing
• Time space tradeoffs for attacks against one-way functions and PRGs
• To label, or not to label (in generic groups)
• Trapdoor memory-hard functions

This page was built for publication: A tight lower bound on the \textsc{TdScrypt} trapdoor memory-hard function

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