Revision as of 16:54, 17 December 2019 edit Bluedeck (talk \| contribs) 317 edits →Motivation ← Previous edit		Revision as of 16:56, 17 December 2019 edit undo Bluedeck (talk \| contribs) 317 edits →Construction Next edit →
Line 22: == Construction == ===depth-robust graph=== For iMHFs in the parallel random oracle model (pROM), it is a known fact that the cumulative pebbling complexity is lower-bounded and upper-bounded by the depth-robustness of a graph. ===scrypt=== *brg ===bit-reversal-graph=== == References ==

Memory-hard function: Difference between revisions