International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

High Parallel Complexity Graphs and Memory-Hard Functions

Authors:
Joël Alwen
Vladimir Serbinenko
Download:
URL: https://eprint.iacr.org/2014/238
Search ePrint
Search Google
BibTeX
@article{eprint-2014-25903,
  title={High Parallel Complexity Graphs and Memory-Hard Functions},
  journal={IACR Cryptology ePrint Archive},
  volume={2014},
  pages={238},
  url={https://eprint.iacr.org/2014/238},
  author={Joël Alwen and Vladimir Serbinenko},
  year=2014
}