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

Authors

37

  1. AB
    Alex Biryukov

    University of Luxembourg, Luxembourg

    3 publications · 225 citations

    3

    h-index

  2. JB
    Jeremiah Blocki

    Carnegie Mellon University, United States

    3 publications · 96 citations

    3

    h-index

  3. DK
    Dmitry Khovratovich

    University of Luxembourg, Luxembourg

    3 publications · 225 citations

    3

    h-index

  4. DD
    Daniel Dinu

    University of Luxembourg, Luxembourg

    3 publications · 225 citations

    3

    h-index

  5. TW
    Ted Wobber

    Microsoft (United States), United States

    2 publications · 310 citations

    2

    h-index

1–5 of 37

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 18 citations

    1

    h-index

  2. Acta Neurologica Scandinavica

    1 publications · 17 citations

    1

    h-index

  3. ACM Transactions on Internet Technology

    TOIT · 1 publications · 216 citations

    1

    h-index

  4. PubMed

    Repository · 1 publications · 10 citations

    1

    h-index

  5. Neuropsychologia

    1 publications · 25 citations

    1

    h-index

1–5