Paper 2024/1644
A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function
Abstract
A trapdoor Memory-Hard Function is a function that is memory-hard to evaluate for any party who does not have a trapdoor, but is substantially less expensive to evaluate with the trapdoor. Biryukov and Perin (ASIACRYPT 2017) introduced the first candidate trapdoor Memory-Hard Function called Diodon which modifies a Memory-Hard Function called Scrypt by replacing a hash chain with repeated squaring modulo a composite number
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- TrapdoorMemory-Hard FunctionsCumulative Memory CostLower Bounds
- Contact author(s)
-
jblocki @ purdue edu
lee2856 @ purdue edu - History
- 2024-10-17: revised
- 2024-10-12: received
- See all versions
- Short URL
- https://ia.cr/2024/1644
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1644, author = {Jeremiah Blocki and Seunghoon Lee}, title = {A Tight Lower Bound on the {TdScrypt} Trapdoor Memory-Hard Function}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1644}, year = {2024}, url = {https://eprint.iacr.org/2024/1644} }