Memory-hard Functions
Memory-Hard Functions is a cryptographic primitive characterized by requiring a significant amount of memory to evaluate, thereby ensuring that computational advantage from parallelization is minimized and providing resistance against large-scale hardware-based attacks.
15
Publications
836
Citations
37
Authors
17
Institutions
Publications per year
2017–2026
5
Parents
15
Moderately hard, memory-bound functions
Martı́n Abadi, Mike Burrows, Mark S. Manasse et al. · ACM Transactions on Internet Technology · 2005 · 216 citations
Moderately Hard, Memory-Bound Functions.
Martı́n Abadi, Michael T. Burrows, Ted Wobber · 2003 · 94 citations
High Parallel Complexity Graphs and Memory-Hard Functions
Joël Alwen, Vladimir Serbinenko · 2015 · 84 citations
1–5 of 15
37
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 37
17
Microsoft (United States)
Redmond, United States
2 h-index
3 publications
465 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
126 citations
University of Luxembourg
Luxembourg, Luxembourg
1 h-index
3 publications
576 citations
Freie Universität Berlin
Berlin, Germany
1 h-index
2 publications
50 citations
Friedrich-Alexander-Universität Erlangen-Nürnberg
Erlangen, Germany
1 h-index
5 publications
120 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
84 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
18 citations

University of Manchester
Manchester, United Kingdom
1 h-index
3 publications
81 citations
1–8 of 17
PVLDB · 1 publications · 18 citations
1
h-index
1 publications · 17 citations
1
h-index
TOIT · 1 publications · 216 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1 publications · 25 citations
1
h-index
1–5