Sustained space and cumulative complexity trade-offs for data-dependent memory-hard functions (Q6163949): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-15982-4_8
+Normal rank
@@ Property / OpenAlex ID @@
+W4312917830
@@ Property / OpenAlex ID: W4312917830 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently Computing Data-Independent Memory-Hard Functions
+Normal rank
@@ Property / cites work @@
+Depth-Robust Graphs and Their Cumulative Memory Complexity
+Normal rank
@@ Property / cites work @@
+Sustained space complexity
@@ Property / cites work: Sustained space complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Scrypt Is Maximally Memory-Hard
@@ Property / cites work: Scrypt Is Maximally Memory-Hard / rank @@
+Normal rank
@@ Property / cites work @@
+High Parallel Complexity Graphs and Memory-Hard Functions
+Normal rank
@@ Property / cites work @@
+Q5875735
@@ Property / cites work: Q5875735 / rank @@
+Normal rank
@@ Property / cites work @@
+Data-independent memory hard functions: new attacks and stronger constructions
+Normal rank
@@ Property / cites work @@
+On the depth-robustness and cumulative pebbling cost of Argon2i
+Normal rank
@@ Property / cites work @@
+On sparse graphs with dense long paths
@@ Property / cites work: On sparse graphs with dense long paths / rank @@
+Normal rank
@@ Property / cites work @@
+On Time Versus Space
@@ Property / cites work: On Time Versus Space / rank @@
+Normal rank