Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.

Joël Alwen Jeremiah Blocki Benjamin Harsha

Published in: CCS (2017)

Keyphrases

dynamic programming
real world
memory space
optimal solution
graph matching
graph representation
bayesian networks
worst case
practical application
graph theory
undirected graph
countermeasures
optimal strategy
graph theoretic
relational structures
memory size